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 listAug 28, 2023 21:34Franek KortaFranek KortaScore: 64,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 21:3464,43052,140,50122,846,000993,0002,437,120
2Aug 28, 2023 21:3464,45748,879,31422,856,000993,0002,437,120
3Aug 28, 2023 21:3464,46848,514,28222,860,000993,0002,527,232
4Aug 28, 2023 21:3464,47047,118,36120,873,0002,981,0002,437,120
5Aug 28, 2023 21:3464,50346,617,57722,872,000994,0002,531,328
6Aug 28, 2023 21:3464,50547,991,39322,873,000994,0002,441,216
7Aug 28, 2023 21:3464,93046,846,76820,020,0004,004,0002,437,120
8Aug 28, 2023 21:3464,98644,669,51323,044,0001,001,0002,441,216
9Aug 28, 2023 21:3465,03545,395,32223,017,0001,046,0002,531,328
10Aug 28, 2023 21:3469,66798,743,26325,776,67302,281,472
11Aug 28, 2023 21:3469,789101,777,13925,821,78402,293,760
12Aug 28, 2023 21:3470,03190,604,78025,911,41102,289,664