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 13:07Dominique GarmierDominique GarmierScore: 35,315Success
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 13:0734,957307,050,009284,654,0001,997,0002,441,216
2Mar 27, 2026 13:0735,315318,004,247286,586,0002,995,0002,342,912
3Mar 27, 2026 13:0735,410314,796,217288,357,0002,002,0002,465,792