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 listNov 4, 2026 19:06e1011e1011Score: 125,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 19:0778,291652,950,378500,289,000141,698,0002,113,536
2Nov 4, 2026 19:07115,018954,650,808806,224,000136,930,0002,113,536
3Nov 4, 2026 19:07120,352998,327,862846,063,000140,831,0002,113,536
4Nov 4, 2026 19:07121,2201,005,047,057854,851,000139,158,0002,113,536
5Nov 4, 2026 19:07125,2801,038,229,228885,992,000141,308,0002,113,536
6Nov 4, 2026 19:07125,7841,042,419,506890,225,000141,210,0002,113,536
7Nov 4, 2026 19:07130,3661,080,150,765931,128,000137,881,0002,113,536
8Nov 4, 2026 19:07135,5471,122,940,496969,980,000141,511,0002,113,536
9Nov 4, 2026 19:07146,2511,210,684,8281,058,018,000141,241,0002,113,536