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 23, 2026 07:14Dominique GarmierDominique GarmierScore: 11,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 07:1411,802123,893,92494,778,0001,995,0002,494,464
2Mar 23, 2026 07:1411,838123,005,09296,075,0001,000,0002,269,184
3Mar 23, 2026 07:1412,043123,824,46496,758,0001,995,0002,428,928