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 14:24TonyTonyScore: 39,739Success
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 14:2439,533338,503,617294,862,00033,267,0002,113,536
2Aug 2, 2026 14:2439,660339,334,331295,626,00033,557,0002,113,536
3Aug 2, 2026 14:2439,680340,179,790295,576,00033,773,0002,113,536
4Aug 2, 2026 14:2439,686340,248,476295,460,00033,937,0002,113,536
5Aug 2, 2026 14:2439,739340,266,717296,397,00033,439,0002,113,536
6Aug 2, 2026 14:2439,782340,414,306296,099,00034,098,0002,113,536
7Aug 2, 2026 14:2440,268345,040,531300,211,00034,021,0002,113,536
8Aug 2, 2026 14:2440,401346,105,141301,255,00034,077,0002,113,536
9Aug 2, 2026 14:2441,538355,697,065309,737,00035,034,0002,113,536