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 23, 2026 18:23Victor MerckléVictor MerckléScore: 2,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:252,58277,473,413200,815,0001,008,0002,170,880stderr
2Aug 23, 2026 18:252,63879,163,767205,886,0001,003,0002,170,880stderr
3Aug 23, 2026 18:252,64479,334,928208,346,0001,280,0002,170,880stderr
4Aug 23, 2026 18:252,66179,855,132208,294,0001,002,0002,170,880stderr
5Aug 23, 2026 18:252,66780,025,084209,865,0001,267,0002,170,880stderr
6Aug 23, 2026 18:252,67580,276,493207,742,0001,008,0002,170,880stderr
7Aug 23, 2026 18:252,69480,845,972209,966,0001,010,0002,170,880stderr
8Aug 23, 2026 18:252,78383,493,244217,208,0001,005,0002,170,880stderr
9Aug 23, 2026 18:252,79083,719,856220,317,0001,199,0002,170,880stderr