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 listMar 10, 2026 21:52olliecrowolliecrowScore: 4,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:524,18657,956,23132,304,0002,019,0002,433,024
2Mar 10, 2026 21:524,25364,565,18733,850,0001,025,0002,482,176
3Mar 10, 2026 21:524,29360,910,84733,190,0002,011,0002,314,240
4Mar 10, 2026 21:524,29959,030,39030,214,0005,035,0002,519,040
5Mar 10, 2026 21:524,30758,680,69532,288,0003,027,0002,490,368
6Mar 10, 2026 21:524,30757,415,03332,294,0003,027,0002,482,176
7Mar 10, 2026 21:524,35963,799,85333,759,0001,985,0002,363,392
8Mar 10, 2026 21:524,44465,053,40935,428,0001,012,0002,392,064
9Mar 10, 2026 21:5219,623183,194,861156,908,0003,997,0002,301,952