Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 11, 2026 18:13olliecrowolliecrowScore: 6,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:135,91676,187,30847,102,0002,004,0002,371,584
2Feb 11, 2026 18:135,92978,751,27848,207,0001,004,0002,506,752
3Feb 11, 2026 18:135,96782,035,66948,514,0001,010,0002,297,856
4Feb 11, 2026 18:136,34483,521,87550,633,0002,025,0002,510,848
5Feb 11, 2026 18:136,36380,157,06049,822,0002,989,0002,519,040
6Feb 11, 2026 18:136,61783,228,87749,929,0004,992,0002,347,008