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 10, 2026 13:34Pavel SkripkinPavel SkripkinScore: 82,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 13:3482,3872,751,620,0242,709,786,0008,995,0002,281,472
2Jan 10, 2026 13:3482,9062,761,813,1012,725,896,0009,992,0002,281,472
3Jan 10, 2026 13:3483,2382,773,425,0142,738,874,0007,996,0002,363,392