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 listJan 18, 2026 04:19Josu San MartinJosu San MartinScore: 9,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 04:199,515100,074,44876,025,0002,000,0002,441,216
2Jan 18, 2026 04:199,522103,530,86976,079,0002,002,0002,449,408
3Jan 18, 2026 04:199,530103,176,04176,139,0002,003,0002,441,216
4Jan 18, 2026 04:199,535103,041,75277,182,0001,002,0002,449,408
5Jan 18, 2026 04:199,53899,358,45677,207,0001,002,0002,342,912
6Jan 18, 2026 04:199,542105,030,53977,238,0001,003,0002,445,312
7Jan 18, 2026 04:199,545104,516,58777,265,0001,003,0002,338,816
8Jan 18, 2026 04:199,547102,049,33577,285,0001,003,0002,453,504
9Jan 18, 2026 04:199,611102,260,12776,819,0001,995,0002,453,504