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 30, 2026 04:02Dominique GarmierDominique GarmierScore: 12,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 04:0212,773131,094,958103,739,000997,0002,396,160
2Mar 30, 2026 04:0212,775132,087,425103,761,000997,0002,363,392
3Mar 30, 2026 04:0212,852135,331,868104,380,0001,003,0002,445,312