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 25, 2026 00:53olliecrowolliecrowScore: 23,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 00:543,30544,867,15625,098,0002,007,0002,310,144
2Apr 25, 2026 00:543,31543,077,08324,169,0003,021,0002,306,048
3Apr 25, 2026 00:543,32741,235,05026,278,0001,010,0002,379,776
4Apr 25, 2026 00:5423,736209,993,727190,650,0003,992,0002,449,408
5Apr 25, 2026 00:5423,756213,347,554190,806,0003,995,0002,502,656
6Apr 25, 2026 00:5423,757212,510,283190,815,0003,996,0002,547,712
7Apr 25, 2026 00:5423,765212,811,962191,880,0002,998,0002,551,808
8Apr 25, 2026 00:5423,774216,943,857192,954,0001,999,0002,531,328
9Apr 25, 2026 00:5423,821213,269,253192,350,0002,989,0002,531,328