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:07marko1597marko1597Score: 2,840Success
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:332,79632,526,69121,812,0001,116,0002,117,632stderr
2Aug 16, 2026 10:332,80532,090,59121,889,0001,113,0002,117,632stderr
3Aug 16, 2026 10:332,80832,737,25021,884,0001,142,0002,117,632stderr
4Aug 16, 2026 10:332,83533,312,56822,119,0001,131,0002,117,632stderr
5Aug 16, 2026 10:332,84032,350,05022,165,0001,125,0002,117,632stderr
6Aug 16, 2026 10:336,95165,930,39555,973,0001,026,0002,117,632stderr
7Aug 16, 2026 10:336,95865,523,65656,047,0001,015,0002,117,632stderr
8Aug 16, 2026 10:337,01865,729,49356,463,0001,085,0002,117,632stderr
9Aug 16, 2026 10:337,12466,854,42657,398,0001,021,0002,117,632stderr