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 25, 2026 10:18Dominique GarmierDominique GarmierScore: 12,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 10:1812,656134,482,741102,786,000997,0002,473,984
2Mar 25, 2026 10:1812,736131,063,127101,425,0003,012,0002,306,048
3Mar 25, 2026 10:1812,738125,412,661101,440,0003,013,0002,514,944