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 listFeb 7, 2026 04:23Josu San MartinJosu San MartinScore: 3,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 04:243,46552,452,87127,399,0001,014,0002,527,232
2Feb 7, 2026 04:243,48156,451,01327,527,0001,019,0002,441,216
3Feb 7, 2026 04:233,48452,580,45825,511,0003,061,0002,334,720
4Feb 7, 2026 04:233,48557,660,17426,537,0002,041,0002,371,584
5Feb 7, 2026 04:233,49854,977,51127,661,0001,024,0002,269,184
6Feb 7, 2026 04:2311,225116,821,78789,046,0003,001,0002,289,664
7Feb 7, 2026 04:2411,250122,303,61792,247,00002,269,184
8Feb 7, 2026 04:2311,304115,718,99090,699,0001,993,0002,523,136
9Feb 7, 2026 04:2311,438125,185,34689,804,0003,991,0002,322,432