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 17:40Andrew EpsteinAndrew EpsteinScore: 13,031Success
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 17:4112,970116,773,752105,344,0001,010,0002,117,632stderr
2Sep 19, 2026 17:4112,970116,816,709105,351,0001,008,0002,117,632stderr
3Sep 19, 2026 17:4113,001117,737,274105,603,0001,007,0002,117,632stderr
4Sep 19, 2026 17:4113,007117,100,779105,658,0001,007,0002,117,632stderr
5Sep 19, 2026 17:4113,031117,332,421105,853,0001,008,0002,117,632stderr
6Sep 19, 2026 17:4113,034117,190,196105,874,0001,009,0002,117,632stderr
7Sep 19, 2026 17:4123,156200,339,097188,881,0001,005,0002,117,632stderr
8Sep 19, 2026 17:4128,147241,265,449229,809,0001,004,0002,117,632stderr
9Sep 19, 2026 17:4128,554245,340,677233,141,0001,004,0002,117,632stderr