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 18, 2025 03:51Chandrasekaran AkashChandrasekaran AkashScore: 60,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 03:5160,38644,314,83321,328,0001,015,0002,269,184
2Apr 18, 2025 03:5160,63845,018,88522,436,00002,445,312
3Apr 18, 2025 03:5160,87048,169,51922,522,00002,453,504