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 1, 2026 10:25Victor MerckléVictor MerckléScore: 2,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 10:262,71530,601,67621,205,0001,064,0002,117,632stderr
2Sep 1, 2026 10:262,73130,570,02521,377,0001,023,0002,117,632stderr
3Sep 1, 2026 10:262,73530,570,18421,368,0001,061,0002,117,632stderr
4Sep 1, 2026 10:262,74430,618,19221,417,0001,086,0002,117,632stderr
5Sep 1, 2026 10:262,74933,743,94621,528,0001,021,0002,117,632stderr
6Sep 1, 2026 10:262,76732,366,41921,593,0001,104,0002,117,632stderr
7Sep 1, 2026 10:265,35952,324,17742,785,0001,165,0002,117,632stderr
8Sep 1, 2026 10:265,37952,250,23242,932,0001,179,0002,117,632stderr
9Sep 1, 2026 10:265,46852,981,46743,827,0001,014,0002,117,632stderr