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 05:59Andrew EpsteinAndrew EpsteinScore: 1,503Success
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 06:021,48244,480,941102,070,0001,223,0002,170,880stderr
2Oct 31, 2026 06:021,48544,570,671102,482,0001,012,0002,170,880stderr
3Oct 31, 2026 06:021,49444,848,790103,041,0001,088,0002,170,880stderr
4Oct 31, 2026 06:021,50045,024,353103,419,0001,192,0002,170,880stderr
5Oct 31, 2026 06:021,50345,118,015104,133,0001,115,0002,170,880stderr
6Oct 31, 2026 06:021,50345,113,698103,710,0001,293,0002,170,880stderr
7Oct 31, 2026 06:021,50945,286,645104,744,0001,108,0002,170,880stderr
8Oct 31, 2026 06:021,51745,519,210105,004,0001,160,0002,170,880stderr
9Oct 31, 2026 06:021,75052,510,867102,951,0001,159,0002,170,880stderr