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 24, 2026 19:14C21C21Score: 41,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:1541,279349,725,933337,488,0001,003,0002,113,536
2Sep 24, 2026 19:1541,285348,999,947337,537,0001,003,0002,113,536
3Sep 24, 2026 19:1541,293349,117,878337,605,0001,003,0002,113,536
4Sep 24, 2026 19:1541,301349,798,779337,670,0001,005,0002,113,536
5Sep 24, 2026 19:1541,308349,340,248337,726,0001,002,0002,113,536
6Sep 24, 2026 19:1541,346349,514,760338,038,0001,004,0002,113,536
7Sep 24, 2026 19:1541,469350,534,851339,046,0001,002,0002,113,536
8Sep 24, 2026 19:1541,582351,424,232339,974,0001,003,0002,113,536
9Sep 24, 2026 19:1541,994355,535,070343,348,0001,003,0002,113,536