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 07:48Andrew 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 07:521,45243,568,34598,388,0001,005,0002,170,880stderr
2Oct 31, 2026 07:521,45443,644,56598,456,0001,006,0002,170,880stderr
3Oct 31, 2026 07:521,46043,809,23098,537,0001,006,0002,170,880stderr
4Oct 31, 2026 07:521,46744,014,18199,549,0001,010,0002,170,880stderr
5Oct 31, 2026 07:521,46744,024,97899,234,0001,008,0002,170,880stderr
6Oct 31, 2026 07:521,48244,482,433100,646,0001,006,0002,170,880stderr
7Oct 31, 2026 07:521,49144,746,502100,691,0001,997,0002,170,880stderr
8Oct 31, 2026 07:521,49444,830,389101,734,0001,005,0002,170,880stderr
9Oct 31, 2026 07:521,50245,066,260101,994,0002,004,0002,170,880stderr