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 listSep 2, 2026 10:36CheckHarryCheckHarryScore: 89,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 10:4288,923748,793,957678,984,00059,078,0002,113,536
2Sep 2, 2026 10:4288,998749,834,755679,747,00058,939,0002,113,536
3Sep 2, 2026 10:4289,007748,657,505679,897,00058,864,0002,113,536
4Sep 2, 2026 10:4289,007748,668,420679,830,00058,930,0002,113,536
5Sep 2, 2026 10:4289,024749,503,752679,943,00058,961,0002,113,536
6Sep 2, 2026 10:4289,027748,821,674680,024,00058,906,0002,113,536
7Sep 2, 2026 10:4289,082749,990,135680,111,00059,270,0002,113,536
8Sep 2, 2026 10:4289,099749,557,166680,206,00059,320,0002,113,536
9Sep 2, 2026 10:4289,153751,075,997680,321,00059,656,0002,113,536