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 listFeb 19, 2026 09:08Aleksei ShahoikaAleksei ShahoikaScore: 13,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 09:0813,427130,668,210108,101,0002,001,0002,363,392
2Feb 19, 2026 09:0813,436136,495,178108,173,0002,003,0002,359,296
3Feb 19, 2026 09:0813,452132,870,561109,308,0001,002,0002,383,872
4Feb 19, 2026 09:0813,468135,291,718108,447,0001,989,0002,367,488
5Feb 19, 2026 09:0813,482135,429,596110,553,00002,457,600
6Feb 19, 2026 09:0813,483136,694,279108,547,0002,010,0002,326,528
7Feb 19, 2026 09:0813,486136,034,823109,581,0001,005,0002,273,280
8Feb 19, 2026 09:0813,493139,984,711110,644,00002,351,104
9Feb 19, 2026 09:0813,534143,629,221108,976,0001,999,0002,355,200