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 10, 2026 17:31Lan Hoang DaoLan Hoang DaoScore: 1,640,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:331,632,49213,560,698,10013,483,645,00066,040,0002,113,536
2Aug 10, 2026 17:331,634,94213,581,276,08913,503,810,00066,214,0002,113,536
3Aug 10, 2026 17:331,635,01913,581,961,08713,504,619,00066,040,0002,113,536
4Aug 10, 2026 17:331,636,99413,597,276,61113,521,998,00065,059,0002,113,536
5Aug 10, 2026 17:331,640,38813,625,351,69213,550,185,00065,038,0002,113,536
6Aug 10, 2026 17:331,644,55413,660,828,21313,584,552,00065,252,0002,113,536
7Aug 10, 2026 17:331,650,23313,708,211,29813,632,904,00064,038,0002,113,536
8Aug 10, 2026 17:331,650,40513,710,151,92313,621,308,00077,057,0002,113,536
9Aug 10, 2026 17:332,046,85417,000,279,27716,922,848,00066,048,0002,113,536