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 listMay 3, 2026 18:23Aleksei ShahoikaAleksei ShahoikaScore: 73,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 18:2772,99745,907,96625,837,0001,172,0002,523,136
2May 3, 2026 18:2773,26442,577,80025,856,0001,252,0002,510,848
3May 3, 2026 18:2773,28942,982,30525,868,0001,249,0002,510,848
4May 3, 2026 18:2773,41845,684,88125,844,0001,321,0002,523,136
5May 3, 2026 18:2773,57242,406,49026,028,0001,194,0002,523,136
6May 3, 2026 18:2773,57547,451,86525,944,0001,279,0002,510,848
7May 3, 2026 18:2773,62943,003,46426,037,0001,206,0002,519,040
8May 3, 2026 18:2773,67544,689,42725,986,0001,274,0002,514,944
9May 3, 2026 18:2773,98147,038,84826,067,0001,306,0002,514,944