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 listSep 15, 2026 02:06Josu San MartinJosu San MartinScore: 4,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 02:074,660139,802,318193,970,0004,161,0002,142,208
2Sep 15, 2026 02:074,660139,816,329193,895,0004,162,0002,142,208
3Sep 15, 2026 02:074,685140,557,889194,566,0004,166,0002,142,208
4Sep 15, 2026 02:074,694140,825,049195,026,0004,163,0002,142,208
5Sep 15, 2026 02:074,698140,957,702195,415,0004,167,0002,142,208
6Sep 15, 2026 02:074,715141,468,753195,923,0004,160,0002,142,208
7Sep 15, 2026 02:074,762142,887,378199,248,0003,186,0002,142,208
8Sep 15, 2026 02:074,789143,677,396198,878,0004,168,0002,142,208
9Sep 15, 2026 02:074,818144,555,777199,727,0004,151,0002,142,208