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 listSep 3, 2026 13:21Josu San MartinJosu San MartinScore: 3,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 13:223,37237,653,47626,582,0001,075,0002,113,536
2Sep 3, 2026 13:223,40838,033,24026,865,0001,084,0002,113,536
3Sep 3, 2026 13:223,41339,166,95526,903,0001,086,0002,113,536
4Sep 3, 2026 13:223,41638,055,58226,925,0001,087,0002,113,536
5Sep 3, 2026 13:223,41638,851,43226,899,0001,117,0002,113,536
6Sep 3, 2026 13:223,41738,137,47626,944,0001,083,0002,113,536
7Sep 3, 2026 13:223,43138,219,68527,043,0001,093,0002,113,536
8Sep 3, 2026 13:223,45239,149,11327,231,0001,079,0002,113,536
9Sep 3, 2026 13:2213,897124,788,091112,903,0001,058,0002,113,536