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 21: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 21:290397,751,498363,197,00013,007,0002,424,832expected "1026573 ", got "1017900 "
2Apr 27, 2026 21:290392,520,166360,442,00013,015,0002,408,448expected "1023140 ", got "1017902 "
3Apr 27, 2026 21:290401,066,169369,092,00013,003,0002,420,736expected "1025165 ", got "1017900 "