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 listSep 3, 2026 18:16Josu San MartinJosu San MartinScore: 3,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 18:173,74240,603,44329,405,0001,282,0002,117,632
2Sep 3, 2026 18:173,76040,835,68429,807,0001,025,0002,117,632
3Sep 3, 2026 18:173,77041,016,95829,896,0001,022,0002,117,632
4Sep 3, 2026 18:173,77040,861,53229,894,0001,021,0002,117,632
5Sep 3, 2026 18:173,77741,696,10629,950,0001,028,0002,117,632
6Sep 3, 2026 18:173,78440,905,84229,738,0001,292,0002,117,632
7Sep 3, 2026 18:173,79143,209,30329,804,0001,288,0002,117,632
8Sep 3, 2026 18:173,80441,117,21030,170,0001,025,0002,117,632
9Sep 3, 2026 18:1715,920140,580,131129,541,0001,009,0002,117,632