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 19, 2026 01:16Dominique GarmierDominique GarmierScore: 13,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 01:1613,178135,687,051104,056,0004,002,0002,379,776
2Mar 19, 2026 01:1613,203135,447,589105,254,0003,007,0002,445,312
3Mar 19, 2026 01:1613,226138,246,297107,453,0001,004,0002,404,352