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 3, 2026 13:56Victor MerckléVictor MerckléScore: 3,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 13:563,16834,437,26524,924,0001,056,0002,117,632stderr
2Aug 3, 2026 13:563,19634,500,01725,194,0001,021,0002,117,632stderr
3Aug 3, 2026 13:563,19934,666,16725,189,0001,048,0002,117,632stderr
4Aug 3, 2026 13:563,20734,665,88625,267,0001,036,0002,117,632stderr
5Aug 3, 2026 13:563,20834,762,26125,286,0001,023,0002,117,632stderr
6Aug 3, 2026 13:563,29635,382,90925,978,0001,056,0002,117,632stderr
7Aug 3, 2026 13:5612,145107,741,63397,556,0002,034,0002,117,632stderr
8Aug 3, 2026 13:5612,252109,440,51499,459,0001,011,0002,117,632stderr
9Aug 3, 2026 13:5612,463110,605,747100,174,0002,026,0002,117,632stderr