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 listJun 8, 2026 04:40anboto1anboto1Score: 5,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 04:435,472192,413,126170,966,0009,635,0002,117,632
2Jun 8, 2026 04:435,508191,376,436172,101,0009,691,0002,117,632
3Jun 8, 2026 04:435,515191,275,626172,425,0009,600,0002,117,632
4Jun 8, 2026 04:435,520191,377,537172,048,00010,118,0002,117,632
5Jun 8, 2026 04:435,527191,591,237172,490,0009,930,0002,117,632
6Jun 8, 2026 04:435,559193,148,536173,623,0009,839,0002,117,632
7Jun 8, 2026 04:435,560193,260,972173,786,0009,720,0002,117,632
8Jun 8, 2026 04:435,590194,122,580174,656,0009,821,0002,117,632
9Jun 8, 2026 04:435,608194,278,108174,783,00010,301,0002,117,632