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 7, 2026 16:25Victor MerckléVictor MerckléScore: 6,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:264,78247,665,92122,251,00016,969,00024,576stderr
2Sep 7, 2026 16:264,78447,378,89321,472,00017,760,00024,576stderr
3Sep 7, 2026 16:265,37952,483,71421,643,00022,465,00028,672stderr
4Sep 7, 2026 16:266,25559,677,03121,683,00029,608,00024,576stderr
5Sep 7, 2026 16:266,56562,014,63121,941,00031,894,00016,801,792stderr
6Sep 7, 2026 16:267,14668,971,80143,030,00015,571,00028,672stderr
7Sep 7, 2026 16:267,29868,249,12843,256,00016,593,00024,576stderr
8Sep 7, 2026 16:268,21275,781,63044,229,00023,113,00024,576stderr
9Sep 7, 2026 16:269,26284,112,80943,960,00031,992,00024,576stderr