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 listJul 30, 2026 20:27wnwnScore: 3,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 20:283,29835,766,22626,368,0001,009,0002,113,536
2Jul 30, 2026 20:283,30235,818,34526,388,0001,025,0002,113,536
3Jul 30, 2026 20:283,30335,823,16126,387,0001,035,0002,113,536
4Jul 30, 2026 20:283,30735,846,28126,425,0001,025,0002,113,536
5Jul 30, 2026 20:283,31635,870,66626,522,0001,002,0002,113,536
6Jul 30, 2026 20:283,46038,467,48127,713,0001,007,0002,113,536
7Jul 30, 2026 20:283,46837,882,76227,775,0001,010,0002,113,536
8Jul 30, 2026 20:283,49837,436,02228,000,0001,035,0002,113,536
9Jul 30, 2026 20:283,51737,582,18928,192,0001,002,0002,113,536