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 listAug 19, 2026 14:46Victor MerckléVictor MerckléScore: 2,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 14:472,79731,194,31021,866,0001,074,0002,117,632stderr
2Aug 19, 2026 14:472,81631,420,05121,982,0001,115,0002,117,632stderr
3Aug 19, 2026 14:472,83532,235,76122,235,0001,014,0002,117,632stderr
4Aug 19, 2026 14:472,84531,797,99122,175,0001,156,0002,117,632stderr
5Aug 19, 2026 14:472,85331,536,26522,389,0001,012,0002,117,632stderr
6Aug 19, 2026 14:472,92532,316,49622,834,0001,155,0002,117,632stderr
7Aug 19, 2026 14:475,43852,910,86043,545,0001,047,0002,117,632stderr
8Aug 19, 2026 14:475,57353,994,36544,565,0001,141,0002,117,632stderr
9Aug 19, 2026 14:475,69563,322,08545,588,0001,114,0002,117,632stderr