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:01Victor MerckléVictor MerckléScore: 77,781Success
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:0277,631654,189,296634,577,0001,998,0002,392,064stderr
2Apr 27, 2026 21:0277,651656,076,334633,744,0002,998,0002,375,680stderr
3Apr 27, 2026 21:0277,691652,877,943636,072,0001,000,0002,531,328stderr
4Apr 27, 2026 21:0277,692656,579,862635,075,0002,000,0002,318,336stderr
5Apr 27, 2026 21:0277,781651,818,309634,809,0002,999,0002,387,968stderr
6Apr 27, 2026 21:0277,812657,147,566636,061,0002,000,0002,383,872stderr
7Apr 27, 2026 21:0277,880654,133,521635,625,0002,998,0002,301,952stderr
8Apr 27, 2026 21:0277,927657,769,769638,009,0001,000,0002,445,312stderr
9Apr 27, 2026 21:0277,966657,916,972639,327,00002,433,024stderr