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 17, 2026 12:41Victor MerckléVictor MerckléScore: 2,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 12:472,21866,544,785167,344,0002,012,0002,170,880stderr
2Aug 17, 2026 12:472,23767,128,519167,118,0002,013,0002,170,880stderr
3Aug 17, 2026 12:472,24467,349,678168,167,0002,038,0002,170,880stderr
4Aug 17, 2026 12:472,24667,382,178169,568,0001,031,0002,170,880stderr
5Aug 17, 2026 12:472,25267,587,250168,534,0001,024,0002,170,880stderr
6Aug 17, 2026 12:472,25967,781,755169,400,0001,035,0002,170,880stderr
7Aug 17, 2026 12:472,26267,877,059167,587,0001,036,0002,170,880stderr
8Aug 17, 2026 12:472,26567,976,353169,746,0001,028,0002,170,880stderr
9Aug 17, 2026 12:472,31969,582,709169,271,0001,032,0002,170,880stderr