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 27, 2026 16:38Dominique GarmierDominique GarmierScore: 18,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 16:3817,421166,473,662138,859,0003,995,0002,281,472
2Mar 27, 2026 16:3818,040169,708,105145,929,0001,999,0002,465,792
3Mar 27, 2026 16:3818,286171,668,235147,947,0001,999,0002,494,464