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 19, 2026 19:01Dominique GarmierDominique GarmierScore: 19,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 19:0119,097181,534,642155,590,0001,003,0002,359,296
2Mar 19, 2026 19:0119,112181,412,248154,725,0001,996,0002,473,984
3Mar 19, 2026 19:0119,217184,450,824156,573,0001,003,0002,510,848