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:09Andrew 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 08:201,46343,911,991100,396,0001,211,0002,154,496stderr
2Oct 31, 2026 08:201,47044,103,492101,359,0001,177,0002,150,400stderr
3Oct 31, 2026 08:201,48644,591,463102,110,0001,190,0002,154,496stderr
4Oct 31, 2026 08:201,48944,675,306103,019,0001,186,0002,150,400stderr
5Oct 31, 2026 08:201,49344,810,559103,208,0001,051,0002,158,592stderr
6Oct 31, 2026 08:201,49644,897,898102,228,0001,032,0002,162,688stderr
7Oct 31, 2026 08:201,50245,071,040104,213,0001,029,0002,154,496stderr
8Oct 31, 2026 08:201,50945,295,128101,804,0002,015,0002,150,400stderr
9Oct 31, 2026 08:201,51645,500,623104,004,0001,181,0002,154,496stderr