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 listOct 1, 2026 21:19C21C21Score: 4,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 21:214,25145,423,07033,793,0001,069,0002,117,632stderr
2Oct 1, 2026 21:214,26045,544,53832,846,0002,093,0002,117,632stderr
3Oct 1, 2026 21:214,26346,215,38232,876,0002,087,0002,117,632stderr
4Oct 1, 2026 21:214,28447,730,67633,000,0002,136,0002,117,632stderr
5Oct 1, 2026 21:214,31245,993,90033,200,0002,165,0002,117,632stderr
6Oct 1, 2026 21:214,31846,713,90833,198,0002,217,0002,117,632stderr
7Oct 1, 2026 21:214,33046,086,33233,327,0002,182,0002,117,632stderr
8Oct 1, 2026 21:218,53881,215,67249,225,00020,790,0002,121,728stderr
9Oct 1, 2026 21:218,54380,698,37348,411,00021,645,0002,121,728stderr