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 listJan 18, 2026 05:08Josu San MartinJosu San MartinScore: 11,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 05:0811,315117,030,88990,792,0001,995,0002,396,160
2Jan 18, 2026 05:0811,316121,297,71489,797,0002,993,0002,265,088
3Jan 18, 2026 05:0811,555119,329,31693,752,000997,0002,502,656