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 2, 2026 16:16TonyTonyScore: 139,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 16:17136,8811,146,083,6511,107,544,00028,571,0002,113,536
2Aug 2, 2026 16:17136,9851,146,904,5311,108,324,00028,658,0002,113,536
3Aug 2, 2026 16:17137,0811,147,812,1961,108,597,00029,176,0002,113,536
4Aug 2, 2026 16:17137,0861,147,752,3961,108,865,00028,954,0002,113,536
5Aug 2, 2026 16:17139,5771,168,422,7261,130,054,00028,439,0002,113,536
6Aug 2, 2026 16:17139,8311,170,569,8301,131,818,00028,785,0002,113,536
7Aug 2, 2026 16:17139,8541,171,093,9751,131,406,00029,387,0002,113,536
8Aug 2, 2026 16:17139,8801,171,190,2141,132,003,00029,007,0002,113,536
9Aug 2, 2026 16:17139,9651,171,749,8311,132,959,00028,751,0002,113,536