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 27, 2026 16:36Victor MerckléVictor MerckléScore: 3,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 16:403,21235,610,51525,214,0001,128,0002,134,016
2Jun 27, 2026 16:403,23235,799,51025,384,0001,119,0002,129,920
3Jun 27, 2026 16:403,31736,525,18126,046,0001,157,0002,129,920
4Jun 27, 2026 16:403,38436,943,60226,640,0001,116,0002,134,016
5Jun 27, 2026 16:403,41337,164,71026,862,0001,129,0002,129,920
6Jun 27, 2026 16:4012,165110,468,37397,340,0002,413,0002,134,016
7Jun 27, 2026 16:4012,230109,478,24198,166,0002,121,0002,174,976
8Jun 27, 2026 16:4012,264109,723,41198,184,0002,384,0002,129,920
9Jun 27, 2026 16:4012,284109,951,71498,375,0002,357,0002,134,016