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 listJul 2, 2026 14:54Victor MerckléVictor MerckléScore: 3,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:552,98532,349,47423,249,0001,234,0002,117,632stderr
2Jul 2, 2026 14:552,99432,436,94223,511,0001,045,0002,117,632stderr
3Jul 2, 2026 14:553,02732,720,01523,784,0001,043,0002,117,632stderr
4Jul 2, 2026 14:553,03732,889,46023,808,0001,102,0002,117,632stderr
5Jul 2, 2026 14:553,03932,783,71023,870,0001,050,0002,117,632stderr
6Jul 2, 2026 14:553,05433,286,90623,975,0001,074,0002,117,632stderr
7Jul 2, 2026 14:5511,869105,235,23296,242,0001,086,0002,117,632stderr
8Jul 2, 2026 14:5511,936105,808,24596,708,0001,173,0002,117,632stderr
9Jul 2, 2026 14:5512,015106,441,14697,354,0001,169,0002,117,632stderr