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:49Andrew EpsteinAndrew EpsteinScore: 1,479Success
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:531,45843,758,73999,696,0001,260,0002,170,880stderr
2Oct 31, 2026 08:531,47244,172,810101,114,0001,119,0002,170,880stderr
3Oct 31, 2026 08:531,47444,240,419101,500,0001,123,0002,170,880stderr
4Oct 31, 2026 08:531,47644,296,219101,553,0001,110,0002,170,880stderr
5Oct 31, 2026 08:531,47944,397,548102,034,0001,112,0002,170,880stderr
6Oct 31, 2026 08:531,49144,743,828102,521,0001,173,0002,170,880stderr
7Oct 31, 2026 08:531,49444,825,846102,786,0001,030,0002,170,880stderr
8Oct 31, 2026 08:531,49544,873,792102,936,0001,025,0002,170,880stderr
9Oct 31, 2026 08:531,51845,540,780104,662,0001,194,0002,170,880stderr