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 16, 2026 18:56Maya RebholzMaya RebholzScore: 45,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 19:0043,354365,142,873315,983,00039,523,0002,281,472
2Jun 16, 2026 19:0043,430365,912,427315,289,00040,844,0002,281,472
3Jun 16, 2026 19:0043,783368,534,636318,623,00040,404,0002,281,472
4Jun 16, 2026 19:0045,041378,660,713325,765,00043,576,0002,281,472
5Jun 16, 2026 19:0045,139379,886,058329,996,00040,147,0002,281,472
6Jun 16, 2026 19:0046,474390,389,322340,843,00040,249,0002,281,472
7Jun 16, 2026 19:0046,520390,806,622341,395,00040,077,0002,281,472
8Jun 16, 2026 19:0046,848393,461,811341,264,00042,894,0002,281,472
9Jun 16, 2026 19:0048,524407,188,547357,319,00040,582,0002,281,472