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 listApr 27, 2026 21:43TudyMTudyMScore: 27,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 21:4327,321243,511,970212,038,00012,002,0002,306,048
2Apr 27, 2026 21:4327,378245,199,915211,533,00012,971,0002,310,144
3Apr 27, 2026 21:4327,439241,452,781216,002,0009,000,0002,306,048
4Apr 27, 2026 21:4327,509247,146,980212,602,00012,975,0002,310,144
5Apr 27, 2026 21:4327,669245,947,809210,897,00015,992,0002,297,856
6Apr 27, 2026 21:4327,883251,444,198220,657,0007,987,0002,293,760
7Apr 27, 2026 21:4327,925244,244,573214,986,00013,999,0002,301,952
8Apr 27, 2026 21:4327,926251,662,066216,000,00013,000,0002,547,712
9Apr 27, 2026 21:4327,950245,554,986216,181,00013,010,0002,396,160