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 listJul 8, 2026 23:40IlyaIlyaScore: 58,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:4258,23231,197,98020,430,0001,116,0002,113,536
2Jul 8, 2026 23:4258,26231,232,09820,444,0001,113,0002,113,536
3Jul 8, 2026 23:4258,34531,277,69120,444,0001,144,0002,113,536
4Jul 8, 2026 23:4258,40531,201,17220,467,0001,143,0002,113,536
5Jul 8, 2026 23:4258,43731,247,91720,523,0001,099,0002,113,536
6Jul 8, 2026 23:4258,46231,241,04620,508,0001,123,0002,113,536
7Jul 8, 2026 23:4258,55631,328,71920,533,0001,133,0002,113,536
8Jul 8, 2026 23:4221,612,7978,006,616,4537,846,484,000150,251,0002,113,536
9Jul 8, 2026 23:4221,752,0458,058,114,3267,897,785,000150,472,0002,113,536