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 24, 2026 17:21Dominique GarmierDominique GarmierScore: 20,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 17:2120,604196,965,45878,978,00089,975,0002,269,184
2Mar 24, 2026 17:2120,892202,087,75284,154,00087,159,0002,433,024
3Mar 24, 2026 17:2121,056199,010,24585,830,00086,828,0002,420,736