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 listJan 8, 2026 04:24Josu San MartinJosu San MartinScore: 17,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 04:2416,829584,038,516551,368,0003,995,0002,277,376
2Jan 8, 2026 04:2417,040589,896,987559,334,0002,996,0002,277,376
3Jan 8, 2026 04:2417,706609,256,282581,313,0002,996,0002,502,656