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:55Andrew EpsteinAndrew EpsteinScore: 1,489Success
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:591,47644,299,831101,543,0001,167,0002,170,880stderr
2Oct 31, 2026 05:591,47844,366,601101,824,0001,203,0002,170,880stderr
3Oct 31, 2026 05:591,48444,547,906102,720,0001,128,0002,162,688stderr
4Oct 31, 2026 05:591,48544,574,110102,503,0001,206,0002,162,688stderr
5Oct 31, 2026 05:591,48944,694,436102,780,0001,011,0002,170,880stderr
6Oct 31, 2026 05:591,49644,887,729103,582,0001,198,0002,170,880stderr
7Oct 31, 2026 05:591,49744,934,521103,738,0001,162,0002,170,880stderr
8Oct 31, 2026 05:591,49944,974,761102,343,0002,030,0002,162,688stderr
9Oct 31, 2026 05:591,52145,653,833103,349,0002,009,0002,162,688stderr