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 listSep 3, 2026 05:56Josu San MartinJosu San MartinScore: 3,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:573,40737,869,12726,904,0001,034,0002,117,632
2Sep 3, 2026 05:573,40937,897,53926,918,0001,040,0002,117,632
3Sep 3, 2026 05:573,43638,800,38327,117,0001,061,0002,117,632
4Sep 3, 2026 05:573,43938,094,55727,167,0001,037,0002,117,632
5Sep 3, 2026 05:573,43938,191,52626,120,0002,080,0002,117,632
6Sep 3, 2026 05:573,44138,146,51426,213,0002,004,0002,117,632
7Sep 3, 2026 05:573,44538,891,98726,232,0002,017,0002,117,632
8Sep 3, 2026 05:573,45939,067,53826,362,0002,009,0002,117,632
9Sep 3, 2026 05:5711,415103,578,76691,522,0002,081,0002,117,632