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 22, 2024 22:41Andrey LikhachevAndrey LikhachevScore: 36,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2024 22:4134,152337,145,225280,048,21602,224,128
2Jun 22, 2024 22:4136,521369,359,475299,475,76602,199,552
3Jun 22, 2024 22:4141,351409,763,621339,076,11402,215,936