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 21:12Pavel SkripkinPavel SkripkinScore: 21,025Success
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 21:1219,726674,552,833647,975,0002,999,0002,449,408
2Jan 19, 2026 21:1220,045683,789,627658,488,0002,997,0002,441,216
3Jan 19, 2026 21:1220,687705,868,902679,667,0002,998,0002,281,472
4Jan 19, 2026 21:1220,948721,905,101688,299,0002,996,0002,539,520
5Jan 19, 2026 21:1221,025717,146,934691,823,0001,999,0002,445,312
6Jan 19, 2026 21:1221,778739,130,190715,674,0002,998,0002,281,472
7Jan 19, 2026 21:1221,799742,003,278716,368,0002,997,0002,433,024
8Jan 19, 2026 21:1222,505772,636,031740,679,0001,999,0002,437,120
9Jan 19, 2026 21:1222,746774,224,318748,632,0001,999,0002,441,216