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 listMar 15, 2026 22:15zielajzielajScore: 3,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:133,50052,502,21327,046,0002,003,0002,519,040
2Mar 15, 2026 22:133,51047,579,17527,125,0002,009,0002,482,176
3Mar 15, 2026 22:153,51152,495,55027,135,0002,010,0002,428,928
4Mar 15, 2026 22:133,52252,999,62327,214,0002,015,0002,433,024
5Mar 15, 2026 22:153,53352,225,54027,304,0002,022,0002,514,944
6Mar 15, 2026 22:153,53754,408,70828,342,0001,012,0002,433,024