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 01:08Dominique GarmierDominique GarmierScore: 23,614Success
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 01:0823,605227,095,009192,565,000997,0002,289,664
2Mar 21, 2026 01:0823,614220,731,754191,636,0001,996,0002,289,664
3Mar 21, 2026 01:0823,687221,200,663193,229,0001,001,0002,289,664