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 listMar 12, 2026 16:03Josu San MartinJosu San MartinScore: 4,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 16:194,41164,412,09334,162,0002,009,0002,310,144
2Mar 12, 2026 16:194,44360,272,48233,395,0003,035,0002,441,216
3Mar 12, 2026 16:034,44564,184,40033,416,0003,037,0002,310,144
4Mar 12, 2026 16:194,46864,980,14235,617,0001,017,0002,371,584
5Mar 12, 2026 16:034,47565,967,34934,654,0002,038,0002,306,048
6Mar 12, 2026 16:034,51967,121,48334,054,0003,004,0002,359,296