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 01:45e1011e1011Error
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 01:4601,071,651,7881,059,134,0001,001,0002,113,536expected "1022883 ", got "15 "
2Oct 17, 2026 01:4601,108,378,5101,095,888,0001,109,0002,113,536expected "1025017 ", got "15 "
3Oct 17, 2026 01:4601,082,776,1991,070,781,0001,166,0002,113,536expected "1024391 ", got "15 "