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 7, 2026 04:10Victor MerckléVictor MerckléScore: 3,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 04:113,560106,820,475282,496,0002,339,0002,146,304
2Jun 7, 2026 04:113,583107,515,769285,782,0001,014,0002,142,208
3Jun 7, 2026 04:113,587107,639,480283,353,0002,213,0002,142,208
4Jun 7, 2026 04:113,587107,615,951284,352,0002,217,0002,142,208
5Jun 7, 2026 04:113,593107,817,089287,008,0001,007,0002,142,208
6Jun 7, 2026 04:113,594107,841,742282,929,0002,400,0002,146,304
7Jun 7, 2026 04:113,594107,849,912285,826,0002,178,0002,142,208
8Jun 7, 2026 04:113,600108,013,331286,972,0001,087,0002,142,208
9Jun 7, 2026 04:113,618108,557,477285,385,0002,220,0002,142,208