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 listApr 17, 2026 18:14Charles CabergsCharles CabergsScore: 1,925,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 18:141,898,824738,397,034366,729,000335,836,0002,392,064
2Apr 17, 2026 18:141,907,092750,141,368368,282,000337,342,0002,510,848
3Apr 17, 2026 18:141,914,584743,612,464355,697,000352,699,0002,519,040
4Apr 17, 2026 18:141,918,022743,042,340369,827,000339,841,0002,260,992
5Apr 17, 2026 18:141,925,478751,133,271369,185,000343,242,0002,519,040
6Apr 17, 2026 18:141,926,935745,035,527386,440,000326,526,0002,281,472
7Apr 17, 2026 18:141,937,703755,208,176374,974,000341,976,0002,285,568
8Apr 17, 2026 18:141,942,341756,965,983380,763,000337,903,0002,355,200
9Apr 17, 2026 18:141,942,395750,882,802384,761,000333,925,0002,334,720