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 13, 2026 23:06Adam FolwarcznyAdam FolwarcznyScore: 416,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 23:06415,36213,746,336,5966,599,128,0007,107,830,0002,523,136
2Jan 13, 2026 23:06416,37813,775,407,7326,500,435,0007,240,029,0002,523,136
3Jan 13, 2026 23:06418,39313,841,123,8596,595,163,0007,211,804,0002,473,984