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 24, 2026 14:18Dominique GarmierDominique GarmierScore: 13,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 14:1813,188133,837,536106,143,0002,002,0002,347,008
2Mar 24, 2026 14:1813,190137,098,920106,152,0002,002,0002,347,008
3Mar 24, 2026 14:1813,291136,781,838106,988,0001,999,0002,535,424