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 10, 2026 20:25olliecrowolliecrowScore: 16,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:2516,188157,411,417122,765,0009,980,0002,347,008
2Mar 10, 2026 20:2516,478161,423,502125,109,00010,008,0002,351,104
3Mar 10, 2026 20:2521,305199,207,209164,716,0009,982,0002,347,008