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 listSep 1, 2026 06:23Victor MerckléVictor MerckléScore: 1,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:271,79453,840,174129,230,0002,045,0002,170,880stderr
2Sep 1, 2026 06:271,80354,097,561129,242,0001,034,0002,170,880stderr
3Sep 1, 2026 06:271,80354,105,574130,553,0002,020,0002,170,880stderr
4Sep 1, 2026 06:271,82454,732,843129,768,0002,024,0002,170,880stderr
5Sep 1, 2026 06:271,82954,872,100130,626,0002,012,0002,170,880stderr
6Sep 1, 2026 06:271,84155,255,360129,104,0001,043,0002,170,880stderr
7Sep 1, 2026 06:271,85755,711,277131,886,0001,031,0002,170,880stderr
8Sep 1, 2026 06:271,86655,988,246129,852,0002,018,0002,170,880stderr
9Sep 1, 2026 06:272,20466,146,970141,470,0001,008,0002,170,880stderr