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 17, 2026 00:37M-RochatM-RochatScore: 72,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:4072,7292,181,881,2162,162,309,0009,019,0002,150,400
2May 17, 2026 00:4072,7912,183,736,8422,164,236,0009,011,0002,150,400
3May 17, 2026 00:4072,8412,185,258,2542,164,671,0009,016,0002,146,304
4May 17, 2026 00:4072,8842,186,537,3662,166,737,0009,004,0002,146,304
5May 17, 2026 00:4072,8852,186,579,6132,166,916,0009,012,0002,146,304
6May 17, 2026 00:4072,9102,187,314,0772,166,382,0009,010,0002,146,304
7May 17, 2026 00:4073,0712,192,131,5352,169,182,0009,009,0002,146,304
8May 17, 2026 00:4073,3082,199,267,4822,177,813,0009,097,0002,146,304
9May 17, 2026 00:4073,3322,199,968,9062,177,088,00010,008,0002,146,304