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 1, 2026 15:23George SeabridgeGeorge SeabridgeScore: 7,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 15:236,96467,827,24856,727,0001,076,0002,113,536
2Aug 1, 2026 15:236,96468,561,23956,740,0001,069,0002,113,536
3Aug 1, 2026 15:236,96567,856,24056,727,0001,084,0002,113,536
4Aug 1, 2026 15:237,31771,546,83459,652,0001,086,0002,113,536
5Aug 1, 2026 15:237,32770,859,49959,727,0001,088,0002,113,536
6Aug 1, 2026 15:237,33670,915,04659,795,0001,101,0002,113,536
7Aug 1, 2026 15:237,33870,909,75459,811,0001,099,0002,113,536
8Aug 1, 2026 15:237,34270,962,31259,678,0001,267,0002,113,536
9Aug 1, 2026 15:237,34972,547,59459,833,0001,167,0002,113,536