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 listAug 16, 2026 04:59Victor MerckléVictor MerckléScore: 2,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 05:002,94288,273,238233,875,0001,223,0002,170,880stderr
2Aug 16, 2026 05:002,94588,366,646233,031,0001,008,0002,170,880stderr
3Aug 16, 2026 05:002,94688,409,601233,509,0001,024,0002,170,880stderr
4Aug 16, 2026 05:002,95288,586,945234,454,0002,016,0002,170,880stderr
5Aug 16, 2026 05:002,97389,191,288236,333,0001,277,0002,170,880stderr
6Aug 16, 2026 05:002,98089,417,435235,446,0001,016,0002,170,880stderr
7Aug 16, 2026 05:002,99689,891,315236,788,0001,032,0002,170,880stderr
8Aug 16, 2026 05:002,99789,933,655235,476,0002,013,0002,170,880stderr
9Aug 16, 2026 05:003,02290,679,750235,753,0001,022,0002,170,880stderr