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 7, 2026 09:22Victor MerckléVictor MerckléScore: 3,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 09:243,02390,691,709235,157,0003,244,0002,707,456
2Jul 7, 2026 09:243,04091,210,404235,905,0003,398,0002,461,696
3Jul 7, 2026 09:243,05991,786,580234,052,0003,238,0002,707,456
4Jul 7, 2026 09:243,06792,029,656234,995,0003,027,0002,703,360
5Jul 7, 2026 09:243,07292,169,526236,385,0003,250,0002,703,360
6Jul 7, 2026 09:243,07892,351,057234,073,0003,221,0002,465,792
7Jul 7, 2026 09:243,08692,598,851235,427,0003,315,0002,707,456
8Jul 7, 2026 09:243,09592,873,670235,295,0003,283,0002,703,360
9Jul 7, 2026 09:243,09692,882,688235,855,0004,340,0002,707,456