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 31, 2026 10:34Victor MerckléVictor MerckléScore: 1,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 10:351,67250,183,549118,861,0002,016,0002,170,880stderr
2Aug 31, 2026 10:351,67650,309,467119,755,0002,039,0002,170,880stderr
3Aug 31, 2026 10:351,68150,450,034119,534,0002,059,0002,170,880stderr
4Aug 31, 2026 10:351,68750,638,911118,367,0001,013,0002,170,880stderr
5Aug 31, 2026 10:351,69050,716,210119,189,0002,018,0002,170,880stderr
6Aug 31, 2026 10:351,69250,783,018120,481,0001,010,0002,170,880stderr
7Aug 31, 2026 10:351,69250,786,470120,266,0001,028,0002,170,880stderr
8Aug 31, 2026 10:351,69550,852,873118,401,0001,020,0002,170,880stderr
9Aug 31, 2026 10:351,69550,876,854120,381,0001,024,0002,170,880stderr