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 listMay 16, 2026 07:16M-RochatM-RochatScore: 32,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 07:1731,530268,269,244257,537,0001,009,0002,113,536
2May 16, 2026 07:1731,790275,249,315259,438,0001,241,0002,113,536
3May 16, 2026 07:1731,941270,821,294260,699,0001,224,0002,113,536
4May 16, 2026 07:1732,388277,217,855264,356,0001,232,0002,113,536
5May 16, 2026 07:1732,420274,880,789264,567,0001,282,0002,113,536
6May 16, 2026 07:1732,539275,580,673265,824,0001,003,0002,113,536
7May 16, 2026 07:1732,623279,582,978266,254,0001,258,0002,113,536
8May 16, 2026 07:1732,769280,002,615267,478,0001,231,0002,113,536
9May 16, 2026 07:1732,902278,948,819268,798,0001,002,0002,113,536