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 listDec 31, 2025 09:46Rajarshi BasuRajarshi BasuScore: 95,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 09:4688,944755,520,223564,488,000164,850,0002,502,656
2Dec 31, 2025 09:4695,455809,863,889602,795,000179,939,0002,457,600
3Dec 31, 2025 09:46103,452872,996,797668,455,000179,853,0002,392,064