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 listFeb 28, 2026 14:16NoSIMD_C#NoSIMD_C#Score: 2,030,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 14:162,030,34319,135,627,10815,634,043,0001,014,769,000282,624
2Feb 28, 2026 14:162,030,49919,639,591,54015,665,850,000984,241,000274,432
3Feb 28, 2026 14:162,032,24419,284,471,12715,620,509,0001,043,895,000372,736