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 14, 2026 23:13Josu San MartinJosu San MartinScore: 3,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 23:143,423122,061,035111,930,0001,036,0002,113,536
2May 14, 2026 23:143,430124,278,021112,147,0001,047,0002,113,536
3May 14, 2026 23:143,436124,306,829112,340,0001,048,0002,113,536
4May 14, 2026 23:143,442122,303,075112,598,0001,005,0002,113,536
5May 14, 2026 23:143,445124,220,679112,643,0001,051,0002,113,536
6May 14, 2026 23:143,449122,622,442112,802,0001,036,0002,113,536
7May 14, 2026 23:143,456124,997,278113,001,0001,058,0002,113,536
8May 14, 2026 23:143,457124,307,517113,037,0001,049,0002,113,536
9May 14, 2026 23:143,515124,903,696114,990,0001,034,0002,113,536