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 listApr 28, 2026 17:44Victor MerckléVictor MerckléScore: 7,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 17:477,262217,882,787524,533,00046,868,0002,949,120
2Apr 28, 2026 17:477,356220,704,654529,819,00040,986,0002,560,000
3Apr 28, 2026 17:477,366220,990,049519,877,00054,987,0002,781,184
4Apr 28, 2026 17:477,369221,094,786522,944,00045,995,0002,740,224
5Apr 28, 2026 17:477,439223,197,584540,168,00053,016,0002,531,328
6Apr 28, 2026 17:477,553226,607,107554,787,00039,984,0002,461,696
7Apr 28, 2026 17:477,571227,130,423552,095,00043,007,0002,367,488
8Apr 28, 2026 17:477,682230,483,370549,561,00043,964,0002,707,456
9Apr 28, 2026 17:477,711231,355,622554,892,00046,074,0002,723,840