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 12:04olliecrowolliecrowScore: 32,666Success
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 12:0532,020277,038,900258,576,0003,993,0002,441,216
2Apr 24, 2026 12:0532,071283,530,257258,986,0003,999,0002,441,216
3Apr 24, 2026 12:0532,196280,094,422261,012,0003,000,0002,457,600
4Apr 24, 2026 12:0532,410281,870,271260,774,0004,995,0002,445,312
5Apr 24, 2026 12:0532,666290,906,486263,853,0004,012,0002,461,696
6Apr 24, 2026 12:0532,809291,437,833266,041,0003,000,0002,445,312
7Apr 24, 2026 12:0532,885289,650,622266,668,0002,996,0002,445,312
8Apr 24, 2026 12:0533,047289,679,386267,992,0002,999,0002,453,504
9Apr 24, 2026 12:0533,254286,415,247269,693,0002,996,0002,445,312