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 11, 2026 07:26Victor MerckléVictor MerckléScore: 14,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:2714,332482,686,604462,098,00010,883,0002,113,536
2May 11, 2026 07:2714,343485,167,005462,425,00010,910,0002,113,536
3May 11, 2026 07:2714,376484,982,212463,510,00010,910,0002,113,536
4May 11, 2026 07:2714,394485,494,600463,688,00011,330,0002,113,536
5May 11, 2026 07:2714,398489,264,424464,624,00010,527,0002,113,536
6May 11, 2026 07:2714,425486,610,950465,298,00010,730,0002,113,536
7May 11, 2026 07:2714,579490,096,644470,231,00010,893,0002,113,536
8May 11, 2026 07:2714,762497,016,335475,684,00011,483,0002,113,536
9May 11, 2026 07:2714,828498,350,169477,841,00011,500,0002,113,536