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 listOct 31, 2026 09:40Andrew EpsteinAndrew EpsteinScore: 1,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 09:481,45243,560,06198,891,0001,199,0002,162,688stderr
2Oct 31, 2026 09:481,47744,335,043100,840,0001,268,0002,162,688stderr
3Oct 31, 2026 09:481,48244,478,981101,608,0001,115,0002,170,880stderr
4Oct 31, 2026 09:481,48944,690,477102,270,0001,135,0002,170,880stderr
5Oct 31, 2026 09:481,49344,808,106102,863,0001,165,0002,170,880stderr
6Oct 31, 2026 09:481,49744,933,757102,960,0001,117,0002,170,880stderr
7Oct 31, 2026 09:481,49944,987,190103,298,0001,193,0002,170,880stderr
8Oct 31, 2026 09:481,51845,561,697104,515,0001,147,0002,170,880stderr
9Oct 31, 2026 09:481,64349,305,285115,953,0001,153,0002,170,880stderr