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 08:59Andrew EpsteinAndrew EpsteinScore: 1,489Success
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:011,44343,300,58098,454,0001,151,0002,162,688stderr
2Oct 31, 2026 09:011,47644,302,245101,449,0001,125,0002,162,688stderr
3Oct 31, 2026 09:011,47744,336,750101,277,0001,170,0002,170,880stderr
4Oct 31, 2026 09:011,47844,342,162101,285,0001,053,0002,162,688stderr
5Oct 31, 2026 09:011,48944,688,171102,354,0001,184,0002,170,880stderr
6Oct 31, 2026 09:011,49044,711,351102,674,0001,128,0002,170,880stderr
7Oct 31, 2026 09:011,49144,744,829102,702,0001,053,0002,162,688stderr
8Oct 31, 2026 09:011,49944,999,988103,295,0001,104,0002,170,880stderr
9Oct 31, 2026 09:011,53746,116,929106,739,0001,113,0002,170,880stderr