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 listJun 12, 2026 07:55Victor MerckléVictor MerckléScore: 3,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 07:553,07592,269,385239,954,0003,120,0002,650,112
2Jun 12, 2026 07:553,07892,350,628240,320,0003,075,0002,654,208
3Jun 12, 2026 07:553,07892,369,103242,429,0001,022,0002,654,208
4Jun 12, 2026 07:553,08492,524,442240,012,0003,063,0002,654,208
5Jun 12, 2026 07:553,10093,002,760244,023,0001,007,0002,654,208
6Jun 12, 2026 07:553,11093,329,867242,711,0003,067,0002,654,208
7Jun 12, 2026 07:553,11093,318,757244,861,0001,024,0002,654,208
8Jun 12, 2026 07:553,13694,098,714245,451,0003,083,0002,654,208
9Jun 12, 2026 07:553,18095,405,461248,718,0002,020,0002,654,208