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 18:44marko1597marko1597Score: 5,157Success
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 18:454,88548,900,96839,442,0001,111,0002,117,632
2Aug 16, 2026 18:454,93149,233,60239,821,0001,113,0002,117,632
3Aug 16, 2026 18:455,12850,937,56141,456,0001,113,0002,117,632
4Aug 16, 2026 18:455,14350,856,28541,643,0001,047,0002,117,632
5Aug 16, 2026 18:455,15751,068,34041,768,0001,043,0002,117,632
6Aug 16, 2026 18:455,17251,178,82441,818,0001,111,0002,117,632
7Aug 16, 2026 18:455,21651,489,87742,262,0001,034,0002,117,632
8Aug 16, 2026 18:455,25451,822,07442,370,0001,240,0002,117,632
9Aug 16, 2026 18:455,30252,424,08542,893,0001,118,0002,117,632