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 10, 2026 23:22olliecrowolliecrowScore: 3,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 22:573,40658,984,55224,940,0002,992,0002,408,448
2Mar 10, 2026 23:223,41156,048,19325,972,0001,997,0002,482,176
3Mar 10, 2026 22:573,41756,569,01226,022,0002,001,0002,506,752
4Mar 10, 2026 23:223,41957,770,33626,034,0002,002,0002,277,376
5Mar 10, 2026 23:2215,622155,236,034125,100,0003,002,0002,510,848
6Mar 10, 2026 22:5715,645150,809,676125,279,0003,006,0002,416,640