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 13:06Victor MerckléVictor MerckléScore: 2,642Success
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 13:072,61629,800,21520,400,0001,057,0002,117,632stderr
2Sep 1, 2026 13:072,62929,926,11820,504,0001,059,0002,117,632stderr
3Sep 1, 2026 13:072,63029,950,09520,419,0001,147,0002,117,632stderr
4Sep 1, 2026 13:072,63329,940,28720,578,0001,017,0002,117,632stderr
5Sep 1, 2026 13:072,64230,015,33720,637,0001,028,0002,117,632stderr
6Sep 1, 2026 13:072,64330,051,32820,657,0001,020,0002,117,632stderr
7Sep 1, 2026 13:072,64430,709,04820,656,0001,026,0002,117,632stderr
8Sep 1, 2026 13:075,27651,652,92042,094,0001,176,0002,117,632stderr
9Sep 1, 2026 13:075,29952,510,35442,198,0001,256,0002,117,632stderr