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 15, 2026 20:51Victor MerckléVictor MerckléScore: 5,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 20:525,627168,825,609472,873,0003,541,0002,682,880stderr
2Aug 15, 2026 20:525,658169,768,297471,987,0003,509,0002,682,880stderr
3Aug 15, 2026 20:525,709171,270,738480,546,0003,526,0002,682,880stderr
4Aug 15, 2026 20:525,709171,281,371477,098,0003,168,0002,691,072stderr
5Aug 15, 2026 20:525,720171,629,471479,259,0004,505,0002,424,832stderr
6Aug 15, 2026 20:525,731171,959,664482,128,0003,610,0002,682,880stderr
7Aug 15, 2026 20:525,739172,183,585483,150,0003,576,0002,682,880stderr
8Aug 15, 2026 20:525,768173,059,121482,313,0004,571,0002,682,880stderr
9Aug 15, 2026 20:525,772173,160,143484,882,0003,532,0002,682,880stderr