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 01:47Charles CabergsCharles CabergsScore: 34,866Success
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 01:4834,3731,153,209,5341,127,330,0006,995,0002,404,352
2May 1, 2026 01:4834,5801,160,940,5761,134,153,0006,994,0002,457,600
3May 1, 2026 01:4834,8501,165,223,1311,143,070,0007,000,0002,465,792
4May 1, 2026 01:4834,8601,169,122,4141,145,394,0004,997,0002,445,312
5May 1, 2026 01:4834,8661,170,934,3651,141,607,0008,996,0002,318,336
6May 1, 2026 01:4834,8741,166,912,4441,145,869,0004,999,0002,527,232
7May 1, 2026 01:4835,0061,172,936,4161,145,210,0009,993,0002,318,336
8May 1, 2026 01:4835,4001,189,736,4341,162,212,0005,995,0002,551,808
9May 1, 2026 01:4836,7711,230,536,9191,207,474,0005,997,0002,310,144