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:32Victor MerckléVictor MerckléScore: 3,235Success
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:333,21196,355,335249,940,0002,158,0002,142,208
2Jun 7, 2026 04:333,21896,544,439252,369,0001,005,0002,142,208
3Jun 7, 2026 04:333,22796,821,594252,990,0001,011,0002,142,208
4Jun 7, 2026 04:333,23096,929,596252,575,0002,162,0002,142,208
5Jun 7, 2026 04:333,23597,063,462253,477,0001,015,0002,142,208
6Jun 7, 2026 04:333,24897,457,526253,296,0002,169,0002,142,208
7Jun 7, 2026 04:333,25197,545,531253,898,0002,187,0002,142,208
8Jun 7, 2026 04:333,25297,564,035256,103,0001,008,0002,142,208
9Jun 7, 2026 04:333,25397,606,085254,020,0002,172,0002,142,208