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 30, 2026 03:10olliecrowolliecrowScore: 25,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 03:103,27641,117,13424,875,0001,990,0002,355,200
2Apr 30, 2026 03:103,30346,948,44824,080,0003,010,0002,310,144
3Apr 30, 2026 03:103,35242,444,57726,470,0001,018,0002,424,832
4Apr 30, 2026 03:103,45947,477,89827,356,0001,013,0002,334,720
5Apr 30, 2026 03:1025,427225,912,474206,502,0002,004,0002,318,336
6Apr 30, 2026 03:1025,458224,242,134202,764,0005,993,0002,498,560
7Apr 30, 2026 03:1025,470230,502,017205,860,0002,997,0002,498,560
8Apr 30, 2026 03:1025,471228,078,056206,871,0001,998,0002,498,560
9Apr 30, 2026 03:1025,523226,685,968206,291,0003,004,0002,314,240