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:11Victor MerckléVictor MerckléScore: 2,169Success
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 15:122,13864,167,065161,521,0001,057,0002,170,880stderr
2Aug 23, 2026 15:122,14564,366,158161,928,0001,139,0002,170,880stderr
3Aug 23, 2026 15:122,15764,737,157161,193,0001,061,0002,170,880stderr
4Aug 23, 2026 15:122,16364,908,359161,453,0001,145,0002,170,880stderr
5Aug 23, 2026 15:122,16965,087,109161,954,0001,128,0002,170,880stderr
6Aug 23, 2026 15:122,17165,150,361162,027,0001,053,0002,170,880stderr
7Aug 23, 2026 15:122,17865,357,174162,782,0001,073,0002,170,880stderr
8Aug 23, 2026 15:122,18465,527,569165,680,0001,144,0002,170,880stderr
9Aug 23, 2026 15:122,18865,669,734163,819,0001,073,0002,170,880stderr