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:44Andrew EpsteinAndrew EpsteinScore: 1,498Success
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 05:451,47044,126,350100,783,0001,222,0002,170,880stderr
2Oct 31, 2026 05:451,49044,712,066102,570,0001,226,0002,162,688stderr
3Oct 31, 2026 05:451,49344,797,466102,604,0001,174,0002,170,880stderr
4Oct 31, 2026 05:451,49744,911,818103,238,0001,129,0002,170,880stderr
5Oct 31, 2026 05:451,49844,944,387103,476,0001,188,0002,170,880stderr
6Oct 31, 2026 05:451,49844,946,394102,860,0001,285,0002,170,880stderr
7Oct 31, 2026 05:451,50345,101,399104,055,0001,083,0002,170,880stderr
8Oct 31, 2026 05:451,52545,772,590106,089,0001,214,0002,162,688stderr
9Oct 31, 2026 05:451,53446,046,111106,513,0001,273,0002,170,880stderr