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 12, 2026 01:12Victor MerckléVictor MerckléScore: 6,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:136,621226,628,782180,935,00037,590,0002,113,536
2May 12, 2026 01:136,622225,943,168180,950,00037,591,0002,113,536
3May 12, 2026 01:136,651229,612,118180,888,00038,616,0002,113,536
4May 12, 2026 01:136,670227,607,389181,422,00038,689,0002,113,536
5May 12, 2026 01:136,678228,229,539181,763,00038,625,0002,113,536
6May 12, 2026 01:136,681228,229,944182,035,00038,454,0002,113,536
7May 12, 2026 01:136,720231,715,790184,217,00037,554,0002,113,536
8May 12, 2026 01:136,730231,805,820183,409,00038,696,0002,113,536
9May 12, 2026 01:136,774230,859,852184,942,00038,610,0002,113,536