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 16, 2026 08:46M-RochatM-RochatScore: 21,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:4721,117705,814,732692,798,0004,095,0002,113,536
2May 16, 2026 08:4721,256711,102,994697,289,0004,159,0002,113,536
3May 16, 2026 08:4721,259710,406,693697,306,0004,260,0002,113,536
4May 16, 2026 08:4721,268711,851,590697,614,0004,255,0002,113,536
5May 16, 2026 08:4721,294711,782,178698,456,0004,251,0002,113,536
6May 16, 2026 08:4721,381716,834,704701,367,0004,224,0002,113,536
7May 16, 2026 08:4721,819730,700,541715,932,0004,122,0002,113,536
8May 16, 2026 08:4721,899733,192,826718,592,0004,092,0002,113,536
9May 16, 2026 08:4722,174740,959,324727,388,0004,383,0002,113,536