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 18, 2026 03:25Victor MerckléVictor MerckléScore: 5,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 03:454,951148,546,791414,030,0002,047,0002,170,880stderr
2Aug 18, 2026 03:454,970149,129,620414,661,0001,006,0002,170,880stderr
3Aug 18, 2026 03:455,000150,020,368417,943,0001,013,0002,170,880stderr
4Aug 18, 2026 03:455,005150,171,082419,244,0001,999,0002,170,880stderr
5Aug 18, 2026 03:455,021150,656,359418,162,0001,099,0002,170,880stderr
6Aug 18, 2026 03:455,028150,852,080419,133,0001,009,0002,170,880stderr
7Aug 18, 2026 03:455,030150,912,263419,208,0001,006,0002,170,880stderr
8Aug 18, 2026 03:455,050151,504,205423,184,0001,003,0002,170,880stderr
9Aug 18, 2026 03:455,070152,110,879422,725,0001,056,0002,170,880stderr