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 17:43boop34boop34Score: 9,408Success
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 17:439,33687,566,99876,276,0001,218,0002,113,536
2Aug 2, 2026 17:439,33687,380,17776,288,0001,207,0002,113,536
3Aug 2, 2026 17:439,35387,408,70276,425,0001,210,0002,113,536
4Aug 2, 2026 17:439,35987,572,88176,474,0001,212,0002,113,536
5Aug 2, 2026 17:439,40888,005,41576,893,0001,200,0002,113,536
6Aug 2, 2026 17:439,42388,738,13076,993,0001,225,0002,113,536
7Aug 2, 2026 17:439,42490,005,78877,016,0001,210,0002,113,536
8Aug 2, 2026 17:439,43488,304,71177,107,0001,203,0002,113,536
9Aug 2, 2026 17:439,49290,780,52777,524,0001,267,0002,113,536