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 1, 2026 18:40TonyTonyScore: 181,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 18:41181,6771,518,052,9281,449,797,00058,128,0002,113,536
2Aug 1, 2026 18:41181,6981,521,272,7951,449,904,00058,194,0002,113,536
3Aug 1, 2026 18:41181,7111,519,207,0991,449,805,00058,401,0002,113,536
4Aug 1, 2026 18:41181,7281,518,311,7211,449,815,00058,530,0002,113,536
5Aug 1, 2026 18:41181,7491,518,565,8451,449,730,00058,791,0002,113,536
6Aug 1, 2026 18:41181,7961,519,044,3011,450,709,00058,202,0002,113,536
7Aug 1, 2026 18:41181,8031,519,127,2131,449,553,00059,414,0002,113,536
8Aug 1, 2026 18:41181,8081,519,168,6361,450,509,00058,500,0002,113,536
9Aug 1, 2026 18:41194,5031,625,601,4881,555,491,00058,886,0002,113,536