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 02:05Dominique GarmierDominique GarmierScore: 12,452Success
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 02:0512,401128,140,521100,692,000996,0002,400,256
2Mar 27, 2026 02:0512,452131,989,10199,103,0003,003,0002,514,944
3Mar 27, 2026 02:0512,528130,620,88299,741,0002,992,0002,379,776