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 23:14Dominique GarmierDominique GarmierScore: 10,541Success
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 23:1410,498111,562,29382,077,0004,003,0002,465,792
2Mar 21, 2026 23:1410,541112,227,38885,430,0001,005,0002,310,144
3Mar 21, 2026 23:1410,662109,664,50086,425,0001,004,0002,404,352