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 11:00marko1597marko1597Score: 404,902Success
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 11:10403,6203,319,645,1453,308,668,0001,016,0002,117,632stderr
2Aug 16, 2026 11:10404,5333,327,158,2183,316,153,0001,022,0002,117,632stderr
3Aug 16, 2026 11:10404,5703,327,621,7353,315,338,0002,136,0002,117,632stderr
4Aug 16, 2026 11:10404,7963,339,773,7563,317,314,0002,016,0002,117,632stderr
5Aug 16, 2026 11:10404,9023,331,397,6663,319,073,0001,124,0002,117,632stderr
6Aug 16, 2026 11:10405,7283,337,426,6713,325,941,0001,035,0002,117,632stderr
7Aug 16, 2026 11:10405,7543,337,836,1193,326,084,0001,103,0002,117,632stderr
8Aug 16, 2026 11:10406,2963,341,642,0003,330,585,0001,044,0002,117,632stderr
9Aug 16, 2026 11:10409,3403,366,489,0913,354,358,0002,232,0002,117,632stderr