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 listOct 17, 2026 03:47e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 03:4806,820,700,3576,805,570,0003,161,0002,113,536expected "1019112 ", got "1018847 "
2Oct 17, 2026 03:4806,818,676,2426,805,602,0002,067,0002,113,536expected "1025251 ", got "1024978 "
3Oct 17, 2026 03:4806,844,208,6076,831,151,0002,103,0002,113,536expected "1019456 ", got "1019181 "