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 13, 2026 15:14flavio87flavio87Score: 6,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:156,52261,347,32053,106,0001,029,0002,113,536
2May 13, 2026 15:156,57861,843,35253,575,0001,026,0002,113,536
3May 13, 2026 15:156,58663,123,36153,635,0001,029,0002,113,536
4May 13, 2026 15:156,59964,897,92253,760,0001,016,0002,113,536
5May 13, 2026 15:156,63262,381,33054,033,0001,018,0002,113,536
6May 13, 2026 15:156,64662,541,34454,149,0001,016,0002,113,536
7May 13, 2026 15:156,73164,447,48754,855,0001,016,0002,113,536
8May 13, 2026 15:156,73165,943,16654,854,0001,017,0002,113,536
9May 13, 2026 15:156,81464,679,23955,549,0001,015,0002,113,536