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 listApr 27, 2026 16:19Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 16:2005,746,297,9475,704,888,00019,985,0002,330,624expected "1021951 ", got "1020000 "stderr
2Apr 27, 2026 16:2005,765,008,6845,723,819,00015,991,0002,535,424expected "1026685 ", got "1020000 "stderr
3Apr 27, 2026 16:2005,771,490,0995,726,655,00019,988,0002,330,624expected "1024960 ", got "1020000 "stderr