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 09:39olliecrowolliecrowScore: 23,748Success
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 09:393,29343,849,23525,005,0002,000,0002,322,432
2Apr 24, 2026 09:393,29443,084,56125,012,0002,000,0002,301,952
3Apr 24, 2026 09:393,32345,889,42325,236,0002,018,0002,330,624
4Apr 24, 2026 09:3923,731213,458,002192,603,0001,995,0002,338,816
5Apr 24, 2026 09:3923,748210,844,716191,744,0002,996,0002,310,144
6Apr 24, 2026 09:3923,752212,485,629191,773,0002,996,0002,338,816
7Apr 24, 2026 09:3923,753212,876,020191,785,0002,996,0002,531,328
8Apr 24, 2026 09:3923,754215,691,397190,794,0003,995,0002,519,040
9Apr 24, 2026 09:3923,832216,386,308192,424,0003,006,0002,441,216