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 00:27Victor MerckléVictor MerckléScore: 6,654Success
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 00:286,634228,828,465180,368,00038,566,0002,113,536
2May 12, 2026 00:286,635228,010,095180,375,00038,583,0002,113,536
3May 12, 2026 00:286,638226,492,848180,479,00038,591,0002,113,536
4May 12, 2026 00:286,643226,605,502180,599,00038,643,0002,113,536
5May 12, 2026 00:286,654229,510,986181,147,00038,467,0002,113,536
6May 12, 2026 00:286,662228,706,994181,121,00038,741,0002,113,536
7May 12, 2026 00:286,665228,921,736181,182,00038,766,0002,113,536
8May 12, 2026 00:286,676230,469,844181,631,00038,689,0002,113,536
9May 12, 2026 00:286,737229,801,144184,740,00037,600,0002,113,536