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 19, 2026 01:05Dominique GarmierDominique GarmierScore: 20,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 01:0520,095192,182,729162,781,0001,997,0002,371,584
2Mar 19, 2026 01:0520,173194,316,933164,417,0001,002,0002,347,008
3Mar 19, 2026 01:0520,184196,117,895165,505,00002,371,584