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:49olliecrowolliecrowScore: 17,649Success
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:4917,566171,820,385135,043,0009,002,0002,404,352
2Mar 4, 2026 23:4917,649172,982,916134,740,0009,980,0002,502,656
3Mar 4, 2026 23:4917,653174,733,702135,767,0008,984,0002,457,600