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 22, 2026 20:11M-RochatM-RochatScore: 18,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:1217,868601,197,791586,546,0003,108,0002,113,536
2May 22, 2026 20:1218,296614,411,309600,658,0003,132,0002,113,536
3May 22, 2026 20:1218,364615,487,765602,783,0003,251,0002,113,536
4May 22, 2026 20:1218,684626,570,267613,550,0003,048,0002,113,536
5May 22, 2026 20:1218,806631,963,591617,389,0003,217,0002,113,536
6May 22, 2026 20:1219,472652,471,335639,444,0003,158,0002,113,536
7May 22, 2026 20:1219,547655,196,069641,887,0003,188,0002,113,536
8May 22, 2026 20:1219,695659,626,084646,881,0003,055,0002,113,536
9May 22, 2026 20:1219,760661,671,874648,942,0003,170,0002,113,536