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 15:59Victor MerckléVictor MerckléScore: 2,261Success
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 16:002,19165,747,980165,710,0002,026,0002,170,880stderr
2Aug 23, 2026 16:002,22066,610,194165,524,0002,040,0002,170,880stderr
3Aug 23, 2026 16:002,22666,788,278165,893,0001,031,0002,170,880stderr
4Aug 23, 2026 16:002,22966,881,642165,499,0001,028,0002,170,880stderr
5Aug 23, 2026 16:002,26167,858,286169,187,0002,034,0002,170,880stderr
6Aug 23, 2026 16:002,26667,980,507168,775,0001,027,0002,170,880stderr
7Aug 23, 2026 16:002,28568,569,034171,157,0001,019,0002,170,880stderr
8Aug 23, 2026 16:002,29168,731,238171,938,0002,010,0002,170,880stderr
9Aug 23, 2026 16:002,41472,435,012183,632,0001,028,0002,170,880stderr