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 19:06Dominique GarmierDominique GarmierScore: 10,365Success
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 19:0610,352113,187,63882,889,0001,997,0002,330,624
2Mar 24, 2026 19:0610,365108,712,20881,995,0002,999,0002,379,776
3Mar 24, 2026 19:0610,415112,282,20183,391,0002,009,0002,269,184