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 listJul 5, 2026 16:03zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 16:030113,293,491103,067,0002,180,0002,121,728expected "1021809 ", got "1021810 "stderr
2Jul 5, 2026 16:030118,533,380108,316,0002,174,0002,121,728expected "1022934 ", got "1022935 "stderr
3Jul 5, 2026 16:030116,889,855106,650,0002,144,0002,121,728expected "1019907 ", got "1019908 "stderr