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 10:35marko1597marko1597Score: 6,993Success
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 10:402,79631,408,75221,757,0001,175,0002,117,632stderr
2Aug 16, 2026 10:406,95065,150,65955,959,0001,032,0002,117,632stderr
3Aug 16, 2026 10:406,97665,685,72556,042,0001,168,0002,117,632stderr
4Aug 16, 2026 10:406,98065,748,26256,076,0001,166,0002,117,632stderr
5Aug 16, 2026 10:406,99366,464,90056,321,0001,026,0002,117,632stderr
6Aug 16, 2026 10:407,01467,251,28356,411,0001,110,0002,117,632stderr
7Aug 16, 2026 10:407,01466,677,22556,470,0001,050,0002,117,632stderr
8Aug 16, 2026 10:407,03066,179,55556,587,0001,064,0002,117,632stderr
9Aug 16, 2026 10:407,14679,528,89657,522,0001,077,0002,117,632stderr