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 29, 2026 08:35C21C21Score: 3,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 08:363,62340,298,55027,517,0002,194,0002,117,632stderr
2Sep 29, 2026 08:363,64540,386,83427,808,0002,082,0002,117,632stderr
3Sep 29, 2026 08:363,65040,448,79427,763,0002,173,0002,117,632stderr
4Sep 29, 2026 08:363,65140,552,45127,823,0002,117,0002,117,632stderr
5Sep 29, 2026 08:363,65540,431,79027,879,0002,093,0002,117,632stderr
6Sep 29, 2026 08:363,66040,565,05027,928,0002,089,0002,117,632stderr
7Sep 29, 2026 08:363,66540,894,95727,983,0002,074,0002,146,304stderr
8Sep 29, 2026 08:363,68340,674,84428,114,0002,087,0002,117,632stderr
9Sep 29, 2026 08:363,69041,481,11728,126,0002,137,0002,117,632stderr