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 14, 2026 20:34marko1597marko1597Score: 3,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:473,56337,653,49128,189,0001,034,0002,121,728stderr
2Aug 14, 2026 20:473,56637,479,20528,212,0001,033,0002,121,728stderr
3Aug 14, 2026 20:473,57437,690,66028,270,0001,038,0002,121,728stderr
4Aug 14, 2026 20:473,58237,544,15228,341,0001,037,0002,121,728stderr
5Aug 14, 2026 20:473,58637,680,71628,364,0001,043,0002,121,728stderr
6Aug 14, 2026 20:473,59439,173,69528,425,0001,050,0002,121,728stderr
7Aug 14, 2026 20:473,61637,860,38428,610,0001,045,0002,121,728stderr
8Aug 14, 2026 20:473,61738,078,52328,616,0001,048,0002,121,728stderr
9Aug 14, 2026 20:473,62338,164,61828,660,0001,049,0002,121,728stderr