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 listSep 6, 2026 12:02Kevin HeaveyKevin HeaveyScore: 3,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:033,51637,443,59027,976,0001,208,0002,113,536
2Sep 6, 2026 12:033,51637,626,55327,995,0001,193,0002,113,536
3Sep 6, 2026 12:033,52037,709,45528,045,0001,177,0002,113,536
4Sep 6, 2026 12:033,53037,541,86028,107,0001,200,0002,113,536
5Sep 6, 2026 12:033,53437,799,46728,143,0001,195,0002,113,536
6Sep 6, 2026 12:033,54537,943,95228,381,0001,044,0002,113,536
7Sep 6, 2026 12:033,55138,029,04128,330,0001,147,0002,113,536
8Sep 6, 2026 12:033,65638,907,86529,139,0001,207,0002,113,536
9Sep 6, 2026 12:033,85541,214,95030,962,0001,038,0002,113,536