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 listJul 8, 2026 00:04Victor MerckléVictor MerckléScore: 3,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 00:062,96789,024,048235,859,0003,226,0002,707,456
2Jul 8, 2026 00:063,01490,449,159235,327,0003,279,0002,707,456
3Jul 8, 2026 00:063,02490,747,099236,389,0003,265,0002,703,360
4Jul 8, 2026 00:063,02990,886,275234,152,0003,194,0002,703,360
5Jul 8, 2026 00:063,04091,200,508236,818,0003,190,0002,707,456
6Jul 8, 2026 00:063,04591,356,967234,616,0003,274,0002,707,456
7Jul 8, 2026 00:063,05491,643,385233,467,0004,564,0002,703,360
8Jul 8, 2026 00:063,07092,118,115236,360,0003,251,0002,707,456
9Jul 8, 2026 00:063,17095,112,353238,954,0003,220,0002,707,456