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 25, 2026 14:20Dominique GarmierDominique GarmierScore: 74,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 14:2074,522633,043,398610,077,0001,000,0002,277,376
2Mar 25, 2026 14:2074,543636,688,124609,257,0001,997,0002,527,232
3Mar 25, 2026 14:2075,427638,966,992615,501,0002,997,0002,277,376