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 19, 2026 20:30Pavel SkripkinPavel SkripkinScore: 44,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2026 20:3044,6741,499,381,5671,468,232,0005,996,0002,351,104
2Jan 19, 2026 20:3044,7131,496,814,7871,471,523,0003,998,0002,433,024
3Jan 19, 2026 20:3044,7941,507,837,7251,472,192,0005,996,0002,375,680
4Jan 19, 2026 20:3044,8151,502,681,7791,473,897,0004,996,0002,433,024
5Jan 19, 2026 20:3044,8631,505,681,7271,475,466,0004,998,0002,437,120
6Jan 19, 2026 20:3044,9711,507,980,7571,477,038,0006,995,0002,285,568
7Jan 19, 2026 20:3045,0731,507,722,0891,481,410,0005,997,0002,482,176
8Jan 19, 2026 20:3046,6091,565,712,7881,534,112,0003,997,0002,433,024
9Jan 19, 2026 20:3046,7521,568,021,0001,537,814,0004,996,0002,531,328