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 listMar 4, 2026 23:46olliecrowolliecrowScore: 22,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 23:4622,410208,127,160169,777,00013,981,0002,277,376
2Mar 4, 2026 23:4622,455210,169,959171,123,00013,009,0002,482,176
3Mar 4, 2026 23:4622,589212,710,056175,221,00010,012,0002,490,368