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:58Pavel SkripkinPavel SkripkinScore: 70,058Success
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:5867,2512,247,455,3222,211,288,0007,997,0002,355,200
2Jan 10, 2026 13:5870,0582,345,230,7862,302,928,0008,991,0002,281,472
3Jan 10, 2026 13:5871,0842,376,153,4922,337,789,0007,995,0002,281,472