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 22:25M-RochatM-RochatScore: 21,250Success
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 22:3121,008704,254,592689,244,0004,043,0002,113,536
2May 16, 2026 22:3121,131707,875,784693,246,0004,103,0002,113,536
3May 16, 2026 22:3121,196710,727,542695,472,0004,009,0002,113,536
4May 16, 2026 22:3121,201709,147,095696,612,0003,041,0002,113,536
5May 16, 2026 22:3121,250713,157,682697,101,0004,151,0002,113,536
6May 16, 2026 22:3121,398716,018,799702,672,0003,466,0002,113,536
7May 16, 2026 22:3121,417715,569,202702,763,0004,002,0002,113,536
8May 16, 2026 22:3124,100806,053,081792,315,0003,006,0002,113,536
9May 16, 2026 22:3124,145805,684,030793,796,0003,005,0002,113,536