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 22, 2026 23:50izotoffizotoffScore: 31,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 23:5030,588278,896,848249,825,000999,0002,535,424
2Mar 22, 2026 23:5031,117278,076,999252,159,0003,001,0002,326,528
3Mar 22, 2026 23:5031,238281,622,170253,151,0003,001,0002,326,528