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 19, 2026 17:44Victor MerckléVictor MerckléScore: 2,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 17:482,78231,194,37421,654,0001,162,0002,117,632stderr
2Aug 19, 2026 17:482,78931,161,41321,665,0001,211,0002,117,632stderr
3Aug 19, 2026 17:482,78930,987,03021,722,0001,148,0002,117,632stderr
4Aug 19, 2026 17:482,79031,017,12921,686,0001,197,0002,117,632stderr
5Aug 19, 2026 17:482,79030,984,77221,681,0001,201,0002,117,632stderr
6Aug 19, 2026 17:482,80131,069,03221,769,0001,205,0002,117,632stderr
7Aug 19, 2026 17:482,81232,030,86621,850,0001,209,0002,117,632stderr
8Aug 19, 2026 17:485,53153,453,58144,337,0001,018,0002,117,632stderr
9Aug 19, 2026 17:485,54553,802,38944,449,0001,020,0002,117,632stderr