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 11:44Victor MerckléVictor MerckléScore: 5,379Success
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 11:452,70930,584,62421,101,0001,114,0002,117,632stderr
2Sep 1, 2026 11:452,71430,771,54921,242,0001,020,0002,117,632stderr
3Sep 1, 2026 11:452,71530,599,79621,148,0001,121,0002,117,632stderr
4Sep 1, 2026 11:452,73530,532,05721,358,0001,069,0002,117,632stderr
5Sep 1, 2026 11:455,37952,211,42643,097,0001,012,0002,117,632stderr
6Sep 1, 2026 11:455,38952,497,85443,178,0001,013,0002,117,632stderr
7Sep 1, 2026 11:455,39652,624,46643,240,0001,013,0002,117,632stderr
8Sep 1, 2026 11:455,44152,990,69543,602,0001,017,0002,117,632stderr
9Sep 1, 2026 11:4512,007106,989,50597,449,0001,010,0002,117,632stderr