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 listMay 17, 2026 08:15M-RochatM-RochatScore: 10,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:1610,17692,313,18377,174,0006,274,0002,113,536
2May 17, 2026 08:1610,22292,649,05877,509,0006,314,0002,113,536
3May 17, 2026 08:1610,27793,191,27577,719,0006,557,0002,113,536
4May 17, 2026 08:1610,29493,269,69478,087,0006,324,0002,113,536
5May 17, 2026 08:1610,68496,472,87981,432,0006,177,0002,113,536
6May 17, 2026 08:1622,458195,586,033176,848,0007,315,0002,117,632
7May 17, 2026 08:1622,564195,544,949177,656,0007,376,0002,113,536
8May 17, 2026 08:1622,816196,003,540179,460,0007,632,0002,117,632
9May 17, 2026 08:1623,105200,149,808181,908,0007,555,0002,117,632