Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listApr 20, 2026 23:36olliecrowolliecrowScore: 13,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:3713,521405,645,6101,115,420,0008,987,0002,715,648
2Apr 20, 2026 23:3713,678410,341,2911,121,673,0008,981,0002,371,584
3Apr 20, 2026 23:3713,714411,447,7531,118,368,0008,986,0002,408,448
4Apr 20, 2026 23:3713,774413,236,9071,113,977,0008,983,0002,375,680
5Apr 20, 2026 23:3713,846415,384,6771,122,220,0008,985,0002,375,680
6Apr 20, 2026 23:3713,926417,799,4751,125,461,0008,987,0002,408,448
7Apr 20, 2026 23:3714,309429,299,2161,162,335,0009,994,0002,310,144
8Apr 20, 2026 23:3714,341430,231,1561,162,774,0008,975,0002,310,144
9Apr 20, 2026 23:3714,373431,197,2111,165,150,0007,987,0002,506,752