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 listJun 26, 2026 08:33Zhou180Zhou180Score: 21,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:343,46637,593,75427,383,0001,040,0002,117,632
2Jun 26, 2026 08:343,48937,762,34827,559,0001,054,0002,117,632
3Jun 26, 2026 08:343,49337,785,40727,575,0001,068,0002,117,632
4Jun 26, 2026 08:343,51938,398,75227,804,0001,056,0002,117,632
5Jun 26, 2026 08:3421,817188,085,034176,889,0002,013,0002,117,632
6Jun 26, 2026 08:3421,861188,443,897177,248,0002,013,0002,117,632
7Jun 26, 2026 08:3422,298191,996,082179,848,0003,003,0002,117,632
8Jun 26, 2026 08:3422,439193,195,913181,990,0002,011,0002,117,632
9Jun 26, 2026 08:3422,639194,805,061182,619,0003,026,0002,117,632