Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJan 15, 2026 22:46Adam FolwarcznyAdam FolwarcznyScore: 12,104Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 22:4611,994417,602,267378,806,00016,991,0002,383,872
2Jan 15, 2026 22:4612,104422,264,659386,456,00012,981,0002,383,872
3Jan 15, 2026 22:4612,265429,675,041387,764,00016,989,0002,469,888