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 listOct 1, 2026 16:46C21C21Score: 3,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 16:473,37038,224,52125,544,0002,092,0002,113,536
2Oct 1, 2026 16:473,37238,887,52225,406,0002,250,0002,113,536
3Oct 1, 2026 16:473,39938,791,47425,746,0002,129,0002,113,536
4Oct 1, 2026 16:473,40338,842,95125,725,0002,181,0002,113,536
5Oct 1, 2026 16:473,41038,744,95225,752,0002,216,0002,113,536
6Oct 1, 2026 16:473,42140,044,00126,027,0002,030,0002,113,536
7Oct 1, 2026 16:473,43638,798,00326,054,0002,129,0002,113,536
8Oct 1, 2026 16:473,45438,945,26326,044,0002,285,0002,113,536
9Oct 1, 2026 16:479,03784,784,51872,075,0002,030,0002,113,536