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 16:10Maya RebholzMaya RebholzError
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 16:110232,228,294194,970,00027,563,0002,199,552expected "2057822683 ", got "2059604883 "
2Jun 16, 2026 16:1125,628219,698,862183,736,00026,417,0002,199,552
3Jun 16, 2026 16:1126,373225,917,167190,035,00026,226,0002,199,552
4Jun 16, 2026 16:1126,502226,934,082190,971,00026,352,0002,199,552
5Jun 16, 2026 16:1126,896230,171,338194,043,00026,509,0002,199,552
6Jun 16, 2026 16:1127,110231,979,079195,688,00026,615,0002,199,552
7Jun 16, 2026 16:1127,365233,603,610197,569,00026,825,0002,199,552
8Jun 16, 2026 16:1127,466234,894,354198,356,00026,870,0002,199,552
9Jun 16, 2026 16:1127,888238,371,766201,811,00026,877,0002,199,552