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 listMay 25, 2025 10:52KeefeKeefeScore: 19,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 10:5219,207187,113,743157,411,0002,005,0002,404,352
2May 25, 2025 10:5219,241188,281,890156,710,0002,994,0002,371,584
3May 25, 2025 10:5219,243186,201,828157,725,0001,996,0002,371,584
4May 25, 2025 10:5219,246187,554,038156,743,0002,995,0002,367,488
5May 25, 2025 10:5219,246190,137,320157,748,0001,996,0002,363,392
6May 25, 2025 10:5219,247189,012,215157,758,0001,996,0002,437,120
7May 25, 2025 10:5219,252191,643,991156,794,0002,996,0002,441,216
8May 25, 2025 10:5219,256187,152,239157,828,0001,997,0002,375,680
9May 25, 2025 10:5219,259188,089,038157,853,0001,998,0002,494,464