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 listAug 23, 2026 19:07Victor MerckléVictor MerckléScore: 3,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:083,09333,668,60324,278,0001,087,0002,117,632stderr
2Aug 23, 2026 19:083,09334,388,29924,343,0001,021,0002,117,632stderr
3Aug 23, 2026 19:083,11233,843,43424,428,0001,095,0002,117,632stderr
4Aug 23, 2026 19:083,13734,067,92224,700,0001,026,0002,117,632stderr
5Aug 23, 2026 19:083,14635,236,03424,698,0001,101,0002,117,632stderr
6Aug 23, 2026 19:085,72055,259,12445,866,0001,043,0002,117,632stderr
7Aug 23, 2026 19:085,72855,298,97945,931,0001,040,0002,117,632stderr
8Aug 23, 2026 19:085,74055,389,85946,024,0001,047,0002,117,632stderr
9Aug 23, 2026 19:0814,920130,722,753121,338,0001,008,0002,117,632stderr