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 1, 2026 16:42Pavel SkripkinPavel SkripkinScore: 13,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:4312,679434,920,742416,418,0002,002,0002,314,240
2May 1, 2026 16:4312,931446,887,124422,753,0003,997,0002,314,240
3May 1, 2026 16:4313,022444,592,236426,742,0002,998,0002,330,624
4May 1, 2026 16:4313,413461,977,893439,649,0002,997,0002,322,432
5May 1, 2026 16:4313,565468,849,546443,664,0003,996,0002,318,336
6May 1, 2026 16:4313,821473,697,517453,096,0003,000,0002,322,432
7May 1, 2026 16:4314,051483,995,306459,700,0003,997,0002,314,240
8May 1, 2026 16:4314,103478,491,604461,423,0003,995,0002,330,624
9May 1, 2026 16:4314,320490,544,843468,586,0003,996,0002,318,336