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 listMar 25, 2026 20:48Vladimir KravchenkoVladimir KravchenkoScore: 393,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 20:48392,2013,279,257,0053,174,311,00080,956,0002,293,760
2Mar 25, 2026 20:48392,3653,282,410,2073,200,655,00055,976,0002,285,568
3Mar 25, 2026 20:48393,0563,298,329,0413,188,401,00073,962,0002,285,568
4Mar 25, 2026 20:48393,2013,291,160,4773,194,603,00068,969,0002,293,760
5Mar 25, 2026 20:48393,4073,300,339,3583,182,325,00082,956,0002,502,656
6Mar 25, 2026 20:48393,6473,291,737,5533,197,288,00069,984,0002,289,664
7Mar 25, 2026 20:48393,8443,296,993,0443,197,951,00070,954,0002,285,568
8Mar 25, 2026 20:48396,1263,320,106,3443,194,907,00092,939,0002,285,568
9Mar 25, 2026 20:48400,9593,357,948,4223,262,000,00065,959,0002,285,568