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 listMar 5, 2025 02:19KeefeKeefeScore: 50,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2025 02:1949,125437,351,159405,736,0001,998,0002,281,472
2Mar 5, 2025 02:1949,155429,897,293406,987,000999,0002,281,472
3Mar 5, 2025 02:1949,612440,077,249409,782,0001,998,0002,293,760
4Mar 5, 2025 02:1950,105442,989,945414,870,000999,0002,281,472
5Mar 5, 2025 02:1950,110445,832,300413,916,0001,999,0002,281,472
6Mar 5, 2025 02:1950,112440,714,238413,929,0001,999,0002,281,472
7Mar 5, 2025 02:1950,115444,442,004414,954,000999,0002,269,184
8Mar 5, 2025 02:1950,133440,884,375415,105,0001,000,0002,281,472
9Mar 5, 2025 02:1950,326449,104,322412,709,0004,996,0002,281,472