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,494Success
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:571,45743,724,83399,963,0001,143,0002,170,880stderr
2Oct 31, 2026 05:571,47644,297,458101,740,0001,215,0002,170,880stderr
3Oct 31, 2026 05:571,48444,520,037102,060,0001,270,0002,170,880stderr
4Oct 31, 2026 05:571,49344,813,474102,832,0001,190,0002,170,880stderr
5Oct 31, 2026 05:571,49444,834,076103,068,0001,018,0002,162,688stderr
6Oct 31, 2026 05:571,50045,002,060103,581,0001,016,0002,170,880stderr
7Oct 31, 2026 05:571,51045,316,011104,299,0001,238,0002,170,880stderr
8Oct 31, 2026 05:571,51645,482,830104,887,0001,278,0002,170,880stderr
9Oct 31, 2026 05:571,52045,602,637105,165,0001,276,0002,162,688stderr