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 22, 2026 18:39Dominique GarmierDominique GarmierScore: 393,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 18:39387,8299,963,570,810916,886,0002,263,314,000282,624
2Mar 22, 2026 18:39393,6219,967,777,038973,612,0002,254,078,000282,624
3Mar 22, 2026 18:39395,1979,272,131,676966,536,0002,274,080,000327,680