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 23, 2026 07:10Kevin HeaveyKevin HeaveyScore: 3,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:123,31936,368,83426,358,0001,190,0002,113,536
2Sep 23, 2026 07:123,34436,578,53026,715,0001,045,0002,113,536
3Sep 23, 2026 07:123,34636,470,10926,741,0001,035,0002,113,536
4Sep 23, 2026 07:123,34637,360,03426,720,0001,060,0002,113,536
5Sep 23, 2026 07:123,34736,679,24226,675,0001,112,0002,113,536
6Sep 23, 2026 07:123,35036,870,98326,788,0001,018,0002,113,536
7Sep 23, 2026 07:123,35437,415,11726,825,0001,019,0002,113,536
8Sep 23, 2026 07:123,35937,454,49126,683,0001,203,0002,113,536
9Sep 23, 2026 07:123,37038,792,10426,949,0001,029,0002,113,536