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 listJul 7, 2026 16:57Victor MerckléVictor MerckléScore: 2,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 16:582,84931,360,16022,334,0001,031,0002,117,632stderr
2Jul 7, 2026 16:582,85331,414,67122,345,0001,052,0002,117,632stderr
3Jul 7, 2026 16:582,86631,434,76422,410,0001,095,0002,117,632stderr
4Jul 7, 2026 16:582,88931,642,32422,668,0001,022,0002,117,632stderr
5Jul 7, 2026 16:582,89133,290,90122,694,0001,014,0002,117,632stderr
6Jul 7, 2026 16:583,02233,182,78523,606,0001,180,0002,117,632stderr
7Jul 7, 2026 16:5811,658103,521,85294,498,0001,105,0002,117,632stderr
8Jul 7, 2026 16:5811,701103,781,74994,830,0001,119,0002,117,632stderr
9Jul 7, 2026 16:5811,768104,460,23795,443,0001,060,0002,117,632stderr