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 listApr 22, 2026 01:48olliecrowolliecrowScore: 12,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 01:5112,618111,582,290100,461,0003,013,0002,490,368
2Apr 22, 2026 01:5112,768122,042,810101,707,0002,991,0002,469,888
3Apr 22, 2026 01:5112,794112,289,131100,915,0003,996,0002,400,256
4Apr 22, 2026 01:5112,821112,328,782100,127,0005,006,0002,441,216
5Apr 22, 2026 01:5112,848112,609,158101,348,0004,013,0002,461,696
6Apr 22, 2026 01:5112,871112,717,356102,532,0003,015,0002,519,040
7Apr 22, 2026 01:5112,885112,897,049101,636,0004,025,0002,514,944
8Apr 22, 2026 01:5112,895112,934,940101,715,0004,028,0002,375,680
9Apr 22, 2026 01:5113,096114,942,885104,349,0003,039,0002,473,984