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 25, 2026 22:40olliecrowolliecrowScore: 23,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 22:413,39850,244,16724,882,0002,985,0002,416,640stderr
2Apr 25, 2026 22:413,40246,711,22924,915,0002,989,0002,461,696stderr
3Apr 25, 2026 22:413,40744,185,16724,947,0002,993,0002,449,408stderr
4Apr 25, 2026 22:4123,283207,336,344184,926,0005,997,0002,400,256stderr
5Apr 25, 2026 22:4123,283205,887,303184,929,0005,997,0002,404,352stderr
6Apr 25, 2026 22:4123,287207,838,684185,956,0004,998,0002,424,832stderr
7Apr 25, 2026 22:4123,328212,082,597186,283,0005,007,0002,359,296stderr
8Apr 25, 2026 22:4123,344212,843,030188,415,0003,006,0002,437,120stderr
9Apr 25, 2026 22:4123,347209,638,865188,443,0003,007,0002,408,448stderr