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 21, 2026 01:12Dominique GarmierDominique GarmierScore: 14,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 01:1214,134140,463,073114,900,000999,0002,482,176
2Mar 21, 2026 01:1214,157144,103,361114,083,0002,001,0002,506,752
3Mar 21, 2026 01:1214,192140,314,585114,366,0002,006,0002,371,584