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 listAug 2, 2025 20:50Jack FrigaardJack FrigaardScore: 4,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:504,64163,404,03236,494,0002,027,0002,285,568
2Aug 2, 2025 20:504,64970,287,66236,556,0002,030,0002,469,888
3Aug 2, 2025 20:504,68069,233,43035,853,0002,987,0002,461,696
4Aug 2, 2025 20:504,71566,868,49437,127,0002,006,0002,285,568
5Aug 2, 2025 20:504,72963,328,40236,235,0003,019,0002,473,984
6Aug 2, 2025 20:504,74262,657,23936,329,0003,027,0002,285,568