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 listMay 21, 2026 17:21M-RochatM-RochatScore: 25,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:2125,624768,732,552750,576,0006,162,0002,113,536
2May 21, 2026 17:2125,696770,894,456754,228,0006,103,0002,113,536
3May 21, 2026 17:2125,722771,675,224752,270,0006,215,0002,113,536
4May 21, 2026 17:2125,723771,719,940755,166,0006,204,0002,113,536
5May 21, 2026 17:2125,870776,111,742758,007,0006,288,0002,113,536
6May 21, 2026 17:2125,913777,405,878759,934,0006,165,0002,113,536
7May 21, 2026 17:2125,927777,824,020759,527,0006,051,0002,113,536
8May 21, 2026 17:2125,945778,350,577756,952,0006,181,0002,113,536
9May 21, 2026 17:2125,958778,743,196760,864,0006,126,0002,113,536