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:38Victor MerckléVictor MerckléScore: 2,037Success
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:392,00460,129,395145,951,0001,023,0002,170,880stderr
2Aug 23, 2026 15:392,00960,277,186146,388,0001,027,0002,170,880stderr
3Aug 23, 2026 15:392,01260,367,134146,275,0001,045,0002,170,880stderr
4Aug 23, 2026 15:392,01360,412,445148,929,0001,030,0002,170,880stderr
5Aug 23, 2026 15:392,03761,137,088152,014,0002,010,0002,170,880stderr
6Aug 23, 2026 15:392,04561,353,217152,114,0002,048,0002,170,880stderr
7Aug 23, 2026 15:392,06361,917,856151,608,0001,032,0002,170,880stderr
8Aug 23, 2026 15:392,08262,468,104153,189,0001,034,0002,170,880stderr
9Aug 23, 2026 15:392,11463,447,289156,073,0002,024,0002,170,880stderr