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 24, 2026 12:56Dominique GarmierDominique GarmierScore: 314,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 12:56314,5632,609,917,2672,577,420,0001,998,0002,277,376
2Mar 24, 2026 12:56314,8462,600,407,4632,581,739,00002,281,472
3Mar 24, 2026 12:56315,9312,625,028,3282,588,633,0001,998,0002,277,376