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 listJun 16, 2026 15:49Maya RebholzMaya RebholzScore: 38,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 15:4936,908311,895,501261,648,00041,005,0002,154,496
2Jun 16, 2026 15:4937,701318,858,503271,432,00037,719,0002,154,496
3Jun 16, 2026 15:4937,759319,791,562272,163,00037,466,0002,154,496
4Jun 16, 2026 15:4938,396324,063,563273,729,00041,126,0002,154,496
5Jun 16, 2026 15:4938,518325,193,429277,839,00038,015,0002,154,496
6Jun 16, 2026 15:4938,690326,563,516277,229,00040,036,0002,154,496
7Jun 16, 2026 15:4938,693326,463,008276,283,00041,006,0002,154,496
8Jun 16, 2026 15:4939,962337,348,762289,267,00038,428,0002,154,496
9Jun 16, 2026 15:4946,190388,074,260337,729,00041,031,0002,154,496