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 19, 2026 15:30Andrew EpsteinAndrew EpsteinScore: 3,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:312,99134,889,57723,475,0001,052,0002,117,632stderr
2Sep 19, 2026 15:312,99734,952,20623,495,0001,082,0002,117,632stderr
3Sep 19, 2026 15:313,00242,889,20923,553,0001,064,0002,121,728stderr
4Sep 19, 2026 15:313,00334,987,65923,557,0001,069,0002,117,632stderr
5Sep 19, 2026 15:313,00434,940,68223,582,0001,052,0002,117,632stderr
6Sep 19, 2026 15:313,00935,181,57223,625,0001,049,0002,117,632stderr
7Sep 19, 2026 15:313,01535,141,58223,660,0001,068,0002,117,632stderr
8Sep 19, 2026 15:3120,222176,299,564164,816,0001,006,0002,117,632stderr
9Sep 19, 2026 15:3120,783180,801,012169,421,0001,006,0002,117,632stderr