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 13, 2026 02:15Josu San MartinJosu San MartinScore: 11,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 02:1511,207125,561,84987,904,0003,995,0002,363,392
2Mar 13, 2026 02:1511,221116,367,57290,009,0002,000,0002,363,392
3Mar 13, 2026 02:1511,241117,795,46091,173,0001,001,0002,363,392