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 19:00Dominique GarmierDominique GarmierScore: 42,130Success
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 19:0041,527366,085,588339,524,0001,001,0002,392,064
2Mar 19, 2026 19:0042,130374,556,390342,472,0002,995,0002,273,280
3Mar 19, 2026 19:0042,148365,343,276344,616,000998,0002,400,256