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 17:01Victor MerckléVictor MerckléScore: 5,922Success
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 17:025,799173,991,091490,448,0001,193,0002,170,880stderr
2Aug 23, 2026 17:025,883176,512,904497,397,0001,011,0002,170,880stderr
3Aug 23, 2026 17:025,886176,595,207496,295,0001,019,0002,170,880stderr
4Aug 23, 2026 17:025,892176,766,282498,349,0002,005,0002,170,880stderr
5Aug 23, 2026 17:025,922177,675,259496,590,0001,028,0002,170,880stderr
6Aug 23, 2026 17:025,928177,860,694501,036,0002,007,0002,170,880stderr
7Aug 23, 2026 17:025,947178,428,784501,812,0001,017,0002,170,880stderr
8Aug 23, 2026 17:025,972179,178,675504,167,0001,029,0002,170,880stderr
9Aug 23, 2026 17:026,036181,106,446508,016,0001,035,0002,170,880stderr