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 listApr 27, 2026 05:59olliecrowolliecrowScore: 3,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 06:003,31241,092,83125,150,0002,012,0002,297,856
2Apr 27, 2026 06:003,33947,515,68025,352,0002,028,0002,297,856
3Apr 27, 2026 06:003,34942,869,65125,433,0002,034,0002,351,104
4Apr 27, 2026 06:003,35749,006,41025,490,0002,039,0002,502,656
5Apr 27, 2026 06:003,38145,764,04325,749,0001,980,0002,473,984
6Apr 27, 2026 06:0024,888223,596,463199,081,0005,002,0002,547,712
7Apr 27, 2026 06:0024,897221,725,181199,158,0005,003,0002,539,520
8Apr 27, 2026 06:0024,923225,692,778199,367,0005,009,0002,502,656
9Apr 27, 2026 06:0024,971231,106,830198,774,0005,993,0002,461,696