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 23, 2026 21:40Dominique GarmierDominique GarmierScore: 11,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 21:4011,153117,276,11390,464,000994,0002,490,368
2Mar 23, 2026 21:4011,216116,793,22487,976,0003,998,0002,396,160
3Mar 23, 2026 21:4011,352122,977,37989,083,0004,003,0002,326,528