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 listSep 3, 2026 19:57Josu San MartinJosu San MartinScore: 3,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 19:583,48238,525,83727,351,0001,208,0002,117,632
2Sep 3, 2026 19:583,50538,693,36027,729,0001,020,0002,117,632
3Sep 3, 2026 19:583,51638,949,42927,638,0001,201,0002,117,632
4Sep 3, 2026 19:583,52538,856,64427,710,0001,201,0002,117,632
5Sep 3, 2026 19:583,52638,830,26527,891,0001,024,0002,117,632
6Sep 3, 2026 19:583,54639,078,85528,064,0001,020,0002,117,632
7Sep 3, 2026 19:583,54939,140,92828,089,0001,020,0002,117,632
8Sep 3, 2026 19:583,58739,383,12528,389,0001,029,0002,117,632
9Sep 3, 2026 19:5815,713138,772,475127,843,0001,005,0002,117,632