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:28Victor 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:2905,740,343,8955,697,367,00021,985,0002,330,624expected "1019053 ", got "1022285 "stderr
2Apr 27, 2026 16:2905,750,762,8195,713,520,00017,989,0002,347,008expected "1025074 ", got "1022285 "stderr
3Apr 27, 2026 16:2905,793,750,5745,753,972,00020,985,0002,326,528expected "1023592 ", got "1022285 "stderr