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 listApr 21, 2026 09:36olliecrowolliecrowScore: 32,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:3731,034280,370,353251,486,0002,993,0002,506,752
2Apr 21, 2026 09:3731,343279,132,018254,013,0003,000,0002,248,704
3Apr 21, 2026 09:3731,638276,728,346257,432,0002,003,0002,289,664
4Apr 21, 2026 09:3732,026289,662,228260,621,0001,997,0002,498,560
5Apr 21, 2026 09:3732,070287,399,628259,980,0002,999,0002,506,752
6Apr 21, 2026 09:3732,212291,675,313261,145,0003,001,0002,498,560
7Apr 21, 2026 09:3732,318288,657,552262,013,0003,000,0002,506,752
8Apr 21, 2026 09:3732,763292,536,262265,666,0002,996,0002,506,752
9Apr 21, 2026 09:3733,147298,295,539270,810,000999,0002,506,752