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 listMar 26, 2026 19:52Dominique GarmierDominique GarmierScore: 10,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 19:5210,054112,632,62881,435,0001,005,0002,322,432
2Mar 26, 2026 19:5210,201113,057,43683,646,00002,473,984
3Mar 26, 2026 19:5210,219112,251,40781,799,0001,995,0002,486,272