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 20:29Dominique GarmierDominique GarmierScore: 15,622Success
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 20:299,25698,522,02372,906,0002,996,0002,387,968
2Mar 21, 2026 20:2915,506149,748,497125,144,0002,002,0002,387,968
3Mar 21, 2026 20:2915,527149,799,817123,310,0004,010,0002,306,048
4Mar 21, 2026 20:2915,596154,029,640126,892,000999,0002,441,216
5Mar 21, 2026 20:2915,622154,101,011124,094,0004,003,0002,314,240
6Mar 21, 2026 20:2915,665157,131,655127,452,0001,003,0002,469,888
7Mar 21, 2026 20:2915,711159,465,952124,839,0003,994,0002,318,336
8Mar 21, 2026 20:2915,763155,059,138127,255,0002,004,0002,265,088
9Mar 21, 2026 20:2916,028160,040,994129,435,0001,991,0002,326,528