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 listJul 26, 2026 23:24Andrew TsibinAndrew TsibinScore: 16,046Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 23:2516,001480,056,561463,389,0006,653,0002,117,632
2Jul 26, 2026 23:2516,011480,347,126463,800,0006,536,0002,117,632
3Jul 26, 2026 23:2516,018480,560,249463,964,0006,524,0002,117,632
4Jul 26, 2026 23:2516,038481,165,604464,371,0006,656,0002,117,632
5Jul 26, 2026 23:2516,046481,388,168464,590,0006,796,0002,117,632
6Jul 26, 2026 23:2516,094482,827,303464,926,0007,936,0002,117,632
7Jul 26, 2026 23:2516,100483,024,381466,472,0006,595,0002,117,632
8Jul 26, 2026 23:2516,155484,669,541465,923,0008,155,0002,117,632
9Jul 26, 2026 23:2516,701501,059,293466,935,00023,301,0002,117,632