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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 23:063,60637,862,64526,514,0003,059,0002,555,904
2Apr 24, 2026 23:0636,765310,135,859297,484,0003,993,0002,519,040
3Apr 24, 2026 23:0636,868310,060,537297,333,0004,988,0002,404,352
4Apr 24, 2026 23:0636,909310,281,476295,666,0006,992,0002,531,328
5Apr 24, 2026 23:0636,952311,738,717297,007,0006,000,0002,416,640
6Apr 24, 2026 23:0636,959318,589,709300,068,0003,000,0002,387,968
7Apr 24, 2026 23:0636,996312,017,794297,381,0005,987,0002,576,384
8Apr 24, 2026 23:0637,044311,241,243299,769,0003,996,0002,494,464
9Apr 24, 2026 23:0637,069311,484,313299,961,0004,012,0002,457,600