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:57Victor MerckléVictor MerckléScore: 5,894Success
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:585,725171,761,615481,456,0003,503,0002,424,832stderr
2Aug 15, 2026 20:585,763172,899,523485,605,0003,547,0002,682,880stderr
3Aug 15, 2026 20:585,785173,568,741487,766,0003,580,0002,682,880stderr
4Aug 15, 2026 20:585,890176,701,370497,491,0003,201,0002,682,880stderr
5Aug 15, 2026 20:585,894176,831,736494,371,0003,478,0002,424,832stderr
6Aug 15, 2026 20:586,102183,089,243513,133,0003,515,0002,682,880stderr
7Aug 15, 2026 20:586,110183,329,853515,552,0003,226,0002,424,832stderr
8Aug 15, 2026 20:586,275188,279,269530,494,0003,527,0002,682,880stderr
9Aug 15, 2026 20:586,293188,809,010531,520,0003,476,0002,424,832stderr