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 24, 2026 19:08Dominique GarmierDominique GarmierScore: 10,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 19:0810,002111,881,37781,020,0001,000,0002,351,104
2Mar 24, 2026 19:0810,038110,139,42582,310,00002,453,504
3Mar 24, 2026 19:0810,040110,125,38979,316,0003,012,0002,404,352