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 07:52marko1597marko1597Score: 5,815Success
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 08:082,83132,267,42121,937,0001,279,0002,117,632stderr
2Aug 16, 2026 08:082,83432,369,42422,212,0001,029,0002,117,632stderr
3Aug 16, 2026 08:085,78355,912,08346,406,0001,022,0002,117,632stderr
4Aug 16, 2026 08:085,80956,029,07146,617,0001,022,0002,117,632stderr
5Aug 16, 2026 08:085,81555,844,56046,663,0001,027,0002,117,632stderr
6Aug 16, 2026 08:085,84956,186,70146,946,0001,022,0002,117,632stderr
7Aug 16, 2026 08:085,86857,191,11547,093,0001,025,0002,117,632stderr
8Aug 16, 2026 08:085,89756,741,98047,331,0001,027,0002,117,632stderr
9Aug 16, 2026 08:085,91156,933,75847,451,0001,026,0002,117,632stderr