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 12, 2026 22:04Josu San MartinJosu San MartinScore: 3,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 22:043,61053,523,61228,586,0001,020,0002,347,008
2Mar 12, 2026 22:043,76452,910,32428,871,0001,991,0002,289,664
3Mar 12, 2026 22:0411,594119,030,57592,072,0003,002,0002,326,528