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:11Andrew EpsteinAndrew EpsteinScore: 1,467Success
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:191,45143,559,97198,995,0001,275,0002,150,400stderr
2Oct 31, 2026 09:191,45443,639,95299,482,0001,017,0002,150,400stderr
3Oct 31, 2026 09:191,45643,704,25299,657,0001,204,0002,154,496stderr
4Oct 31, 2026 09:191,46443,922,788100,396,0001,037,0002,154,496stderr
5Oct 31, 2026 09:191,46744,034,816100,571,0001,019,0002,154,496stderr
6Oct 31, 2026 09:191,47344,209,646100,876,0001,278,0002,162,688stderr
7Oct 31, 2026 09:191,47444,242,261101,035,0001,292,0002,150,400stderr
8Oct 31, 2026 09:191,47644,289,409101,108,0001,279,0002,170,880stderr
9Oct 31, 2026 09:191,48044,418,107101,517,0001,287,0002,154,496stderr