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 listMay 4, 2026 23:51olliecrowolliecrowScore: 6,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:586,80672,670,64354,270,0002,226,0002,494,464
2May 4, 2026 23:586,85872,614,13154,731,0002,194,0002,293,760
3May 4, 2026 23:586,97873,503,45655,695,0002,225,0002,498,560
4May 4, 2026 23:586,98278,278,39655,626,0002,326,0002,514,944
5May 4, 2026 23:586,98874,223,74655,681,0002,323,0002,437,120
6May 4, 2026 23:586,98874,067,49555,733,0002,273,0002,306,048
7May 4, 2026 23:587,00171,904,00755,848,0002,266,0002,334,720
8May 4, 2026 23:587,00776,319,98655,893,0002,268,0002,314,240
9May 4, 2026 23:587,01775,309,79156,196,0002,053,0002,437,120