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 25, 2026 00:27Dominique GarmierDominique GarmierScore: 27,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 00:2727,075248,768,64083,005,000139,009,0002,318,336
2Mar 25, 2026 00:2727,309251,546,33181,977,000141,960,0002,318,336
3Mar 25, 2026 00:2727,327248,376,17680,669,000143,413,0002,465,792