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 13, 2025 14:10Emanuele BolognesiEmanuele BolognesiScore: 9,828,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2025 14:109,779,7846,090,016,1362,651,143,000967,377,000401,408
2Apr 13, 2025 14:109,788,5816,125,488,6492,623,351,000998,424,000401,408
3Apr 13, 2025 14:109,822,3356,114,085,4062,646,026,000988,238,000401,408
4Apr 13, 2025 14:109,826,5356,530,643,7912,651,854,000983,964,000401,408
5Apr 13, 2025 14:109,828,2166,094,293,9242,636,670,000999,770,000442,368
6Apr 13, 2025 14:109,853,6436,185,497,9072,614,345,0001,031,503,000401,408
7Apr 13, 2025 14:109,866,9926,311,047,9552,626,286,0001,024,501,000434,176
8Apr 13, 2025 14:109,878,3496,261,869,4512,650,727,0001,004,262,000421,888
9Apr 13, 2025 14:109,883,9386,866,162,4542,650,203,0001,006,854,000266,240