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 14:23Pavel SkripkinPavel SkripkinScore: 63,468Success
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 14:2361,7352,069,446,6702,032,260,0004,998,0002,486,272
2Jan 10, 2026 14:2363,4682,119,567,8302,087,434,0006,994,0002,363,392
3Jan 10, 2026 14:2364,1902,147,126,9132,112,261,0005,995,0002,465,792