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 16, 2026 12:33marko1597marko1597Score: 293,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 12:40292,2512,406,448,1122,395,357,0001,105,0002,117,632stderr
2Aug 16, 2026 12:40292,9742,412,418,3022,401,247,0001,144,0002,117,632stderr
3Aug 16, 2026 12:40293,3142,416,775,6862,404,104,0001,077,0002,117,632stderr
4Aug 16, 2026 12:40293,5832,417,660,8262,406,235,0001,147,0002,117,632stderr
5Aug 16, 2026 12:40293,6352,417,852,8932,406,786,0001,023,0002,117,632stderr
6Aug 16, 2026 12:40293,8952,420,280,6812,406,813,0003,133,0002,117,632stderr
7Aug 16, 2026 12:40294,1352,421,879,0302,410,887,0001,025,0002,117,632stderr
8Aug 16, 2026 12:40294,5352,425,105,3982,414,161,0001,030,0002,117,632stderr
9Aug 16, 2026 12:40295,0262,430,258,4222,418,170,0001,045,0002,117,632stderr