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 listMay 17, 2026 03:52M-RochatM-RochatScore: 22,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:5322,656758,356,370742,439,0005,209,0002,113,536
2May 17, 2026 03:5322,703759,502,728744,006,0005,215,0002,113,536
3May 17, 2026 03:5322,863764,733,404749,370,0005,128,0002,113,536
4May 17, 2026 03:5322,874765,552,167749,675,0005,199,0002,113,536
5May 17, 2026 03:5322,913767,038,395750,947,0005,187,0002,113,536
6May 17, 2026 03:5322,929766,688,908751,561,0005,114,0002,113,536
7May 17, 2026 03:5322,961767,014,068752,532,0005,194,0002,113,536
8May 17, 2026 03:5323,062769,947,134755,881,0005,191,0002,113,536
9May 17, 2026 03:5323,605789,741,063773,695,0005,288,0002,113,536