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 09:05Dominique GarmierDominique GarmierScore: 78,858Success
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 09:0578,383672,754,391547,778,00094,961,0002,469,888
2Mar 22, 2026 09:0578,858671,149,134546,689,00099,943,0002,490,368
3Mar 22, 2026 09:0581,385743,397,918546,838,000120,523,0002,494,464