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 31, 2026 10:55Victor MerckléVictor MerckléScore: 1,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 10:561,66449,925,999117,468,0001,005,0002,170,880stderr
2Aug 31, 2026 10:561,66750,011,545118,203,0001,033,0002,170,880stderr
3Aug 31, 2026 10:561,67850,345,560119,011,0002,046,0002,170,880stderr
4Aug 31, 2026 10:561,68150,438,181120,004,0001,015,0002,170,880stderr
5Aug 31, 2026 10:561,68650,587,718118,058,0001,028,0002,170,880stderr
6Aug 31, 2026 10:561,69450,840,818119,394,0001,022,0002,170,880stderr
7Aug 31, 2026 10:561,70451,137,805119,413,0001,029,0002,170,880stderr
8Aug 31, 2026 10:561,71451,428,304119,775,0001,026,0002,170,880stderr
9Aug 31, 2026 10:561,71851,569,747118,838,0001,032,0002,170,880stderr