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 3, 2026 11:27Victor MerckléVictor MerckléScore: 11,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 11:282,94533,422,16623,025,0001,130,0002,117,632stderr
2Jul 3, 2026 11:282,96132,258,78023,174,0001,110,0002,117,632stderr
3Jul 3, 2026 11:283,01232,657,57723,684,0001,022,0002,117,632stderr
4Jul 3, 2026 11:283,03432,717,93523,863,0001,023,0002,117,632stderr
5Jul 3, 2026 11:2811,857105,144,25896,110,0001,123,0002,117,632stderr
6Jul 3, 2026 11:2811,909105,655,24496,522,0001,136,0002,117,632stderr
7Jul 3, 2026 11:2811,924105,664,63596,741,0001,040,0002,117,632stderr
8Jul 3, 2026 11:2811,933105,800,53796,706,0001,151,0002,117,632stderr
9Jul 3, 2026 11:2811,954105,875,15796,974,0001,054,0002,117,632stderr