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 listApr 1, 2026 20:28leoweleoweScore: 458,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 20:28458,3323,834,087,4623,710,201,00093,954,0002,285,568
2Apr 1, 2026 20:28458,3553,830,165,1183,720,404,00083,941,0002,289,664
3Apr 1, 2026 20:28458,3593,832,309,8833,735,428,00068,952,0002,293,760
4Apr 1, 2026 20:28458,4773,834,508,4913,735,412,00069,951,0002,293,760
5Apr 1, 2026 20:28458,8053,835,428,4693,740,118,00067,965,0002,285,568
6Apr 1, 2026 20:28461,2013,857,629,5553,761,003,00066,964,0002,285,568
7Apr 1, 2026 20:28463,7173,877,090,4703,779,890,00068,961,0002,289,664
8Apr 1, 2026 20:28465,3383,886,697,7783,798,335,00063,971,0002,506,752
9Apr 1, 2026 20:28465,9823,895,513,6213,803,688,00063,961,0002,289,664