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 21, 2026 20:23Dominique GarmierDominique GarmierScore: 13,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:2313,084136,713,086103,276,0004,010,0002,506,752
2Mar 21, 2026 20:2313,140130,684,730104,753,0002,992,0002,351,104
3Mar 21, 2026 20:2313,193134,416,333104,179,0004,006,0002,363,392