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 19, 2026 15:15Andrew EpsteinAndrew EpsteinScore: 29,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:1629,258251,127,948236,905,0003,011,0002,117,632stderr
2Sep 19, 2026 15:1629,447253,155,957238,249,0003,224,0002,117,632stderr
3Sep 19, 2026 15:1629,468252,750,586238,584,0003,054,0002,117,632stderr
4Sep 19, 2026 15:1629,498253,141,442238,452,0003,434,0002,117,632stderr
5Sep 19, 2026 15:1629,598253,207,428239,644,0003,065,0002,117,632stderr
6Sep 19, 2026 15:1629,674254,055,325240,283,0003,049,0002,117,632stderr
7Sep 19, 2026 15:1629,919255,728,346242,247,0003,096,0002,117,632stderr
8Sep 19, 2026 15:1629,960256,026,433242,368,0003,304,0002,117,632stderr
9Sep 19, 2026 15:1629,975256,158,933242,521,0003,281,0002,117,632stderr