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 9, 2025 16:31NoSIMD_C#NoSIMD_C#Score: 272,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 16:31271,908127,082,29154,327,00046,279,0002,498,560
2Apr 9, 2025 16:31272,454127,044,78350,903,00049,905,0002,535,424
3Apr 9, 2025 16:31272,665131,894,52854,938,00045,948,0002,543,616