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 listAug 23, 2026 18:12Victor MerckléVictor MerckléScore: 5,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:132,73730,790,50321,363,0001,084,0002,117,632stderr
2Aug 23, 2026 18:132,75530,954,41321,487,0001,104,0002,117,632stderr
3Aug 23, 2026 18:132,75831,018,33521,594,0001,022,0002,117,632stderr
4Aug 23, 2026 18:135,38052,450,20443,066,0001,052,0002,117,632stderr
5Aug 23, 2026 18:135,39452,585,29043,173,0001,058,0002,117,632stderr
6Aug 23, 2026 18:135,40652,829,02643,244,0001,091,0002,117,632stderr
7Aug 23, 2026 18:135,40652,664,71343,221,0001,115,0002,117,632stderr
8Aug 23, 2026 18:135,42052,823,44043,339,0001,112,0002,117,632stderr
9Aug 23, 2026 18:135,45853,150,63943,614,0001,149,0002,117,632stderr