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 13, 2021 14:56Yuriy LyfenkoYuriy LyfenkoScore: 107,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 14:56106,51959,492,39238,402,0001,010,0002,510,848
2Jul 13, 2021 14:56106,64962,337,99738,449,0001,011,0002,334,720
3Jul 13, 2021 14:56106,70557,722,47437,457,0002,024,0002,330,624
4Jul 13, 2021 14:56106,84165,316,81337,504,0002,027,0002,514,944
5Jul 13, 2021 14:56106,90365,825,59937,526,0002,028,0002,334,720
6Jul 13, 2021 14:56106,94664,562,47238,556,0001,014,0002,334,720
7Jul 13, 2021 14:56107,01671,859,56938,581,0001,015,0002,383,872
8Jul 13, 2021 14:56107,02265,662,21237,568,0002,030,0002,523,136
9Jul 13, 2021 14:56107,13270,579,92239,639,00002,387,968
10Jul 13, 2021 14:56109,391117,321,25240,474,65802,187,264
11Jul 13, 2021 14:56109,45996,938,43740,499,80802,174,976
12Jul 13, 2021 14:56109,841101,075,56340,641,02302,183,168