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 18, 2026 20:41C21C21Score: 53,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 20:4252,672447,275,778435,952,0001,231,0002,113,536
2Aug 18, 2026 20:4252,836448,632,842437,375,0001,164,0002,113,536
3Aug 18, 2026 20:4252,911449,967,038438,165,0001,003,0002,113,536
4Aug 18, 2026 20:4252,954450,247,979438,523,0001,002,0002,113,536
5Aug 18, 2026 20:4253,155452,034,492440,190,0001,001,0002,113,536
6Aug 18, 2026 20:4253,211451,814,409440,651,0001,006,0002,113,536
7Aug 18, 2026 20:4253,302452,481,654441,263,0001,147,0002,113,536
8Aug 18, 2026 20:4253,364452,976,739441,772,0001,157,0002,113,536
9Aug 18, 2026 20:4253,401453,287,936442,029,0001,204,0002,113,536