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 listJun 26, 2026 03:58Victor MerckléVictor MerckléScore: 2,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 03:592,82784,826,297226,744,0003,046,0002,658,304
2Jun 26, 2026 03:592,84885,455,072228,588,0003,053,0002,658,304
3Jun 26, 2026 03:592,85885,743,196231,667,0001,016,0002,658,304
4Jun 26, 2026 03:592,86585,974,698230,037,0003,134,0002,658,304
5Jun 26, 2026 03:592,87086,122,740230,327,0003,211,0002,654,208
6Jun 26, 2026 03:592,88086,428,144230,896,0003,103,0002,654,208
7Jun 26, 2026 03:592,88186,457,162230,238,0003,182,0002,658,304
8Jun 26, 2026 03:592,94288,275,823232,625,0003,097,0002,654,208
9Jun 26, 2026 03:592,95188,545,029232,293,0003,101,0002,416,640