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 19, 2026 08:48Victor MerckléVictor MerckléScore: 3,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 08:492,91632,189,95522,657,0001,256,0002,117,632stderr
2Aug 19, 2026 08:492,93633,129,73622,832,0001,249,0002,117,632stderr
3Aug 19, 2026 08:492,99032,710,47123,237,0001,287,0002,117,632stderr
4Aug 19, 2026 08:493,04733,120,42723,696,0001,296,0002,117,632stderr
5Aug 19, 2026 08:493,12334,624,62624,583,0001,028,0002,117,632stderr
6Aug 19, 2026 08:495,66954,781,61044,468,0002,020,0002,117,632stderr
7Aug 19, 2026 08:495,67155,316,41545,483,0001,021,0002,117,632stderr
8Aug 19, 2026 08:495,67554,707,85145,515,0001,022,0002,117,632stderr
9Aug 19, 2026 08:495,70055,761,53845,720,0001,022,0002,117,632stderr