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 16, 2026 11:20marko1597marko1597Score: 15,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 11:3614,418130,447,447109,856,0009,818,0002,113,536
2Aug 16, 2026 11:3614,815134,217,181112,465,00010,507,0002,113,536
3Aug 16, 2026 11:3614,913134,570,676113,443,00010,340,0002,113,536
4Aug 16, 2026 11:3615,092135,323,277114,565,00010,700,0002,113,536
5Aug 16, 2026 11:3615,106135,375,608114,778,00010,604,0002,113,536
6Aug 16, 2026 11:3615,491138,583,336118,237,00010,342,0002,113,536
7Aug 16, 2026 11:3615,581140,058,098118,834,00010,495,0002,113,536
8Aug 16, 2026 11:3615,643140,586,789119,317,00010,528,0002,113,536
9Aug 16, 2026 11:3615,818142,042,722120,936,00010,360,0002,113,536