Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJun 16, 2026 18:38Maya RebholzMaya RebholzScore: 26,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 18:3925,536219,030,783182,976,00026,420,0002,199,552
2Jun 16, 2026 18:3926,186224,319,097188,248,00026,482,0002,199,552
3Jun 16, 2026 18:3926,364225,413,447186,950,00029,236,0002,199,552
4Jun 16, 2026 18:3926,387225,604,944186,919,00029,460,0002,199,552
5Jun 16, 2026 18:3926,406226,065,352190,113,00026,420,0002,199,552
6Jun 16, 2026 18:3926,909229,962,648191,025,00029,636,0002,199,552
7Jun 16, 2026 18:3927,110231,957,549195,457,00026,850,0002,199,552
8Jun 16, 2026 18:3927,270233,034,593193,921,00029,695,0002,199,552
9Jun 16, 2026 18:3927,413234,082,480194,981,00029,807,0002,199,552