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 08:02Victor MerckléVictor MerckléScore: 2,988Success
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 08:042,92687,794,728231,667,0003,190,0002,711,552stderr
2Jul 8, 2026 08:042,94688,398,650232,905,0003,190,0002,711,552stderr
3Jul 8, 2026 08:042,95988,799,782232,926,0003,207,0002,711,552stderr
4Jul 8, 2026 08:042,97989,375,779231,989,0004,526,0002,711,552stderr
5Jul 8, 2026 08:042,98889,642,151233,608,0003,132,0002,711,552stderr
6Jul 8, 2026 08:042,99289,774,094233,761,0005,567,0002,707,456stderr
7Jul 8, 2026 08:042,99289,776,787233,604,0003,189,0002,703,360stderr
8Jul 8, 2026 08:043,00590,164,417234,023,0003,144,0002,711,552stderr
9Jul 8, 2026 08:043,01890,564,513234,217,0003,192,0002,711,552stderr