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 29, 2026 10:34Victor MerckléVictor MerckléScore: 2,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:362,71930,612,43421,216,0001,080,0002,117,632stderr
2Aug 29, 2026 10:362,72930,694,37921,304,0001,080,0002,117,632stderr
3Aug 29, 2026 10:362,74231,531,15121,476,0001,013,0002,117,632stderr
4Aug 29, 2026 10:362,74830,798,84821,509,0001,032,0002,117,632stderr
5Aug 29, 2026 10:362,75030,680,92421,535,0001,020,0002,117,632stderr
6Aug 29, 2026 10:362,76430,814,27921,603,0001,065,0002,117,632stderr
7Aug 29, 2026 10:362,86931,855,80922,495,0001,034,0002,117,632stderr
8Aug 29, 2026 10:365,39253,873,11943,172,0001,043,0002,117,632stderr
9Aug 29, 2026 10:365,40752,507,96543,281,0001,059,0002,117,632stderr