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 listFeb 7, 2026 01:22Josu San MartinJosu San MartinScore: 7,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 01:227,16984,250,78949,820,0008,967,0002,486,272
2Feb 7, 2026 01:227,24089,925,28853,334,0006,037,0002,342,912
3Feb 7, 2026 01:227,28583,001,75256,749,0002,986,0002,277,376
4Feb 7, 2026 01:227,39584,853,72554,576,0006,064,0002,392,064
5Feb 7, 2026 01:227,41588,921,50851,830,0008,970,0002,306,048
6Feb 7, 2026 01:227,45290,229,64955,099,0006,010,0002,404,352
7Feb 7, 2026 01:227,49489,273,50858,431,0003,022,0002,338,816
8Feb 7, 2026 01:227,50584,689,91857,503,0004,035,0002,314,240
9Feb 7, 2026 01:227,65288,332,05657,768,0004,980,0002,375,680