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 listMay 4, 2026 23:48olliecrowolliecrowScore: 7,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:497,54277,039,44760,331,0002,268,0002,498,560
2May 4, 2026 23:497,57082,047,90660,613,0002,221,0002,560,000
3May 4, 2026 23:497,57878,135,07060,585,0002,317,0002,371,584
4May 4, 2026 23:497,58179,438,94360,639,0002,284,0002,420,736
5May 4, 2026 23:497,58781,171,76260,930,0002,045,0002,490,368
6May 4, 2026 23:497,59481,394,66660,733,0002,304,0002,482,176
7May 4, 2026 23:497,63380,627,43361,075,0002,281,0002,449,408
8May 4, 2026 23:497,66079,134,33161,375,0002,211,0002,342,912
9May 4, 2026 23:497,72783,309,51161,865,0002,274,0002,514,944