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 22, 2026 23:56olliecrowolliecrowScore: 12,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 23:595,22759,244,43038,877,0003,987,0002,371,584
2Apr 22, 2026 23:595,25059,365,66741,051,0002,002,0002,502,656
3Apr 22, 2026 23:595,28050,597,23940,276,0003,020,0002,355,200
4Apr 22, 2026 23:595,37051,332,18539,938,0004,096,0002,457,600
5Apr 22, 2026 23:5912,782137,791,620101,876,0002,938,0002,338,816
6Apr 22, 2026 23:5938,649324,476,959311,924,0004,998,0002,572,288
7Apr 22, 2026 23:5938,770326,488,692315,919,0001,999,0002,396,160
8Apr 22, 2026 23:5938,831327,138,701315,423,0002,994,0002,416,640
9Apr 22, 2026 23:5939,541331,765,829319,241,0005,003,0002,396,160