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 02:39Victor MerckléVictor MerckléScore: 2,920Success
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 02:392,81884,560,529228,130,0001,024,0002,658,304
2Jun 26, 2026 02:392,84985,476,318230,923,0001,011,0002,658,304
3Jun 26, 2026 02:392,85585,673,397231,531,0001,024,0002,658,304
4Jun 26, 2026 02:392,91487,440,108231,104,0003,096,0002,658,304
5Jun 26, 2026 02:392,92087,609,940231,733,0003,133,0002,654,208
6Jun 26, 2026 02:392,92487,738,835231,142,0003,081,0002,658,304
7Jun 26, 2026 02:392,93187,936,839231,916,0003,219,0002,654,208
8Jun 26, 2026 02:392,93488,036,734232,162,0003,391,0002,658,304
9Jun 26, 2026 02:392,94988,491,373234,082,0001,029,0002,658,304