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 23, 2026 03:24olliecrowolliecrowScore: 23,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 03:253,30447,595,06424,084,0003,010,0002,498,560
2Apr 23, 2026 03:253,31146,311,14625,146,0002,011,0002,539,520
3Apr 23, 2026 03:2523,747210,372,052189,736,0004,993,0002,408,448
4Apr 23, 2026 03:2523,752216,435,272191,778,0002,996,0002,551,808
5Apr 23, 2026 03:2523,763214,861,896190,860,0003,997,0002,519,040
6Apr 23, 2026 03:2523,772207,121,441192,939,0001,999,0002,322,432
7Apr 23, 2026 03:2523,778211,331,020191,984,0002,999,0002,555,904
8Apr 23, 2026 03:2523,783209,682,591191,024,0004,000,0002,506,752
9Apr 23, 2026 03:2523,809208,861,095193,237,0002,002,0002,527,232