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 listJun 23, 2026 21:04Victor MerckléVictor MerckléScore: 3,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 21:053,03332,465,46423,672,0001,204,0002,117,632stderr
2Jun 23, 2026 21:053,03832,562,84823,795,0001,123,0002,117,632stderr
3Jun 23, 2026 21:053,05432,873,35523,821,0001,223,0002,117,632stderr
4Jun 23, 2026 21:053,11033,127,24824,269,0001,235,0002,117,632stderr
5Jun 23, 2026 21:053,11233,232,65924,309,0001,210,0002,117,632stderr
6Jun 23, 2026 21:0511,927105,425,91696,798,0001,010,0002,117,632stderr
7Jun 23, 2026 21:0512,022106,153,36097,573,0001,009,0002,117,632stderr
8Jun 23, 2026 21:0512,060106,533,08597,885,0001,010,0002,117,632stderr
9Jun 23, 2026 21:0512,152107,285,45798,643,0001,009,0002,117,632stderr