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 listSep 8, 2026 06:01Victor MerckléVictor MerckléScore: 3,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 06:022,64330,068,80120,570,0001,109,00024,576stderr
2Sep 8, 2026 06:022,83531,737,86520,617,0002,632,00024,576stderr
3Sep 8, 2026 06:022,85831,775,47020,519,0002,917,00024,576stderr
4Sep 8, 2026 06:023,11033,716,48620,518,0004,985,00024,576stderr
5Sep 8, 2026 06:023,31035,320,31020,722,0006,423,00024,576stderr
6Sep 8, 2026 06:023,58546,977,84121,714,0007,687,00024,576stderr
7Sep 8, 2026 06:023,59137,709,56920,827,0008,620,00024,576stderr
8Sep 8, 2026 06:023,65045,549,41521,440,0008,493,00024,576stderr
9Sep 8, 2026 06:025,38561,136,42943,141,0001,017,00024,576stderr