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:30Andrew EpsteinAndrew EpsteinScore: 1,470Success
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:331,46643,988,709100,068,0001,254,0002,170,880stderr
2Oct 31, 2026 08:331,46744,012,493100,142,0001,244,0002,170,880stderr
3Oct 31, 2026 08:331,46944,076,121100,463,0001,204,0002,170,880stderr
4Oct 31, 2026 08:331,47044,129,822100,881,0001,110,0002,170,880stderr
5Oct 31, 2026 08:331,47044,107,557100,599,0001,110,0002,170,880stderr
6Oct 31, 2026 08:331,47244,180,382101,353,0001,105,0002,170,880stderr
7Oct 31, 2026 08:331,48144,450,007101,863,0001,143,0002,170,880stderr
8Oct 31, 2026 08:331,48444,540,601101,999,0001,195,0002,162,688stderr
9Oct 31, 2026 08:331,51045,322,420104,137,0001,156,0002,170,880stderr