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 25, 2026 18:24olliecrowolliecrowScore: 3,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 18:243,44450,014,63725,217,0003,026,0002,514,944
2Apr 25, 2026 18:243,45749,899,90826,324,0002,024,0002,514,944
3Apr 25, 2026 18:243,48047,256,15425,481,0003,057,0002,330,624
4Apr 25, 2026 18:243,48047,743,47525,484,0003,058,0002,584,576
5Apr 25, 2026 18:243,48647,814,45926,551,0002,042,0002,465,792
6Apr 25, 2026 18:2423,874216,388,757191,779,0003,995,0002,310,144
7Apr 25, 2026 18:2423,892212,815,073191,918,0003,998,0002,400,256
8Apr 25, 2026 18:2423,958213,425,498192,451,0004,009,0002,510,848
9Apr 25, 2026 18:2424,095217,497,012192,595,0004,989,0002,514,944