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 2, 2026 15:09CheckHarryCheckHarryScore: 6,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 15:126,50964,097,71052,859,0001,171,0002,113,536
2Sep 2, 2026 15:126,54864,428,91953,116,0001,234,0002,113,536
3Sep 2, 2026 15:126,55264,648,03953,224,0001,162,0002,113,536
4Sep 2, 2026 15:126,56564,537,65653,337,0001,158,0002,113,536
5Sep 2, 2026 15:126,57564,561,34453,421,0001,153,0002,113,536
6Sep 2, 2026 15:126,57864,649,82153,414,0001,187,0002,113,536
7Sep 2, 2026 15:126,58564,717,63653,494,0001,164,0002,113,536
8Sep 2, 2026 15:126,61667,282,15453,678,0001,240,0002,113,536
9Sep 2, 2026 15:126,64265,552,94553,857,0001,273,0002,113,536