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 17:52Pavel SkripkinPavel SkripkinScore: 59,412Success
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 17:5258,8931,971,121,7921,939,487,0003,998,0002,510,848
2Jan 10, 2026 17:5258,9041,978,875,0471,937,831,0005,996,0002,351,104
3Jan 10, 2026 17:5259,1871,987,936,0401,948,185,0004,997,0002,433,024
4Jan 10, 2026 17:5259,2251,985,090,0341,948,438,0005,998,0002,355,200
5Jan 10, 2026 17:5259,4121,988,154,3031,954,588,0005,995,0002,363,392
6Jan 10, 2026 17:5259,7542,001,611,4041,964,880,0006,996,0002,281,472
7Jan 10, 2026 17:5261,2872,047,749,6722,016,466,0005,995,0002,281,472
8Jan 10, 2026 17:5261,3712,049,950,4782,019,231,0005,997,0002,355,200
9Jan 10, 2026 17:5261,3962,056,046,6662,020,061,0005,997,0002,281,472