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 listOct 18, 2024 17:43Sybrand AarnoutseSybrand AarnoutseScore: 308,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2024 17:43259,2062,925,984,1341,061,746,0001,063,745,0002,445,312
2Oct 18, 2024 17:43308,7564,496,338,0291,269,932,0001,261,869,0002,465,792
3Oct 18, 2024 17:43374,7455,850,805,0191,430,354,0001,642,555,0002,351,104