TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJul 15, 2026 02:14Fernando AntunezFernando AntunezError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 02:14037,978,27227,219,0001,285,0002,113,536expected "429496533614 ", got "218418879287120293 "
2Jul 15, 2026 02:14038,325,34927,711,0001,034,0002,117,632expected "429496535787 ", got "219766495615056289 "
3Jul 15, 2026 02:14046,779,49627,991,0001,020,0002,117,632expected "429496496818 ", got "210106377654925384 "