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 20, 2026 05:56M-RochatM-RochatScore: 11,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:5711,801107,218,07095,597,0002,357,0002,113,536
2May 20, 2026 05:5711,806107,372,36695,662,0002,335,0002,113,536
3May 20, 2026 05:5711,819107,684,19096,087,0002,014,0002,113,536
4May 20, 2026 05:5711,841110,218,53095,941,0002,347,0002,113,536
5May 20, 2026 05:5711,861109,797,43596,104,0002,343,0002,113,536
6May 20, 2026 05:5711,862109,976,48296,122,0002,340,0002,117,632
7May 20, 2026 05:5711,881108,412,55496,550,0002,066,0002,113,536
8May 20, 2026 05:5711,884108,213,38396,584,0002,058,0002,113,536
9May 20, 2026 05:5711,888110,875,55396,602,0002,069,0002,113,536