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:36M-RochatM-RochatScore: 27,856Success
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:4027,606921,861,297904,096,0006,932,0002,113,536
2May 16, 2026 08:4027,610920,157,307904,028,0007,114,0002,113,536
3May 16, 2026 08:4027,717923,643,240907,781,0006,880,0002,113,536
4May 16, 2026 08:4027,797928,219,689910,119,0007,213,0002,113,536
5May 16, 2026 08:4027,856930,331,895912,053,0007,196,0002,113,536
6May 16, 2026 08:4027,887931,247,392913,064,0007,220,0002,113,536
7May 16, 2026 08:4027,971934,031,013916,031,0007,015,0002,113,536
8May 16, 2026 08:4028,197940,003,846923,292,0007,234,0002,113,536
9May 16, 2026 08:4029,422980,681,210963,544,0007,398,0002,113,536