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 26, 2026 23:44Victor MerckléVictor MerckléScore: 5,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:445,26152,059,83642,416,0001,257,0002,113,536
2Aug 26, 2026 23:445,26252,935,85342,663,0001,019,0002,113,536
3Aug 26, 2026 23:445,27052,088,24742,551,0001,198,0002,113,536
4Aug 26, 2026 23:445,28152,306,13942,564,0001,276,0002,113,536
5Aug 26, 2026 23:445,30152,355,25842,726,0001,277,0002,113,536
6Aug 26, 2026 23:445,30852,451,79142,788,0001,271,0002,113,536
7Aug 26, 2026 23:445,30952,551,46643,057,0001,014,0002,113,536
8Aug 26, 2026 23:445,45653,708,03344,017,0001,269,0002,113,536
9Aug 26, 2026 23:445,65255,986,10545,726,0001,190,0002,113,536