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 listMar 3, 2026 04:57Josu San MartinJosu San MartinScore: 186,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 04:57181,8655,042,449,368456,942,0001,034,351,000274,432
2Mar 3, 2026 04:57186,1424,572,871,633495,968,0001,030,400,000323,584
3Mar 3, 2026 04:57201,0524,563,661,182630,060,0001,018,564,000282,624