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 18:22Yuriy LyfenkoYuriy LyfenkoScore: 64,478Success
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 18:2264,173550,864,19821,766,0001,978,0002,281,472
2Jul 13, 2021 18:2264,276551,132,65122,792,000990,0002,285,568
3Jul 13, 2021 18:2264,276547,774,90321,801,0001,981,0002,281,472
4Jul 13, 2021 18:2264,284549,872,77621,803,0001,982,0002,277,376
5Jul 13, 2021 18:2264,351545,877,53621,826,0001,984,0002,285,568
6Jul 13, 2021 18:2264,403545,584,28921,844,0001,985,0002,285,568
7Jul 13, 2021 18:2264,478546,103,39021,869,0001,988,0002,285,568
8Jul 13, 2021 18:2264,622553,514,30622,914,000996,0002,285,568
9Jul 13, 2021 18:2264,686551,369,96821,940,0001,994,0002,281,472
10Jul 13, 2021 18:2266,706588,260,63824,681,15802,244,608
11Jul 13, 2021 18:2266,791582,682,68424,712,69602,244,608
12Jul 13, 2021 18:2267,116575,172,58724,833,06802,248,704