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 28, 2026 13:03Dominique GarmierDominique GarmierScore: 13,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 13:0313,806141,886,936111,204,0002,003,0002,281,472
2Mar 28, 2026 13:0313,873136,971,374111,767,0001,995,0002,314,240
3Mar 28, 2026 13:0313,874133,032,166112,769,000997,0002,396,160