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 19, 2026 09:18Victor MerckléVictor MerckléScore: 4,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 09:194,228126,860,881343,159,0003,283,0002,494,464
2Jun 19, 2026 09:194,287128,617,619347,581,0003,310,0002,494,464
3Jun 19, 2026 09:194,287128,638,380345,294,0003,364,0002,498,560
4Jun 19, 2026 09:194,299128,998,308349,414,0003,175,0002,498,560
5Jun 19, 2026 09:194,299128,978,384348,812,0003,107,0002,494,464
6Jun 19, 2026 09:194,305129,157,620348,763,0003,165,0002,498,560
7Jun 19, 2026 09:194,314129,444,254348,310,0003,107,0002,494,464
8Jun 19, 2026 09:194,318129,568,049350,044,0003,253,0002,498,560
9Jun 19, 2026 09:194,320129,615,667349,791,0003,101,0002,498,560