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 listJun 29, 2026 08:15Adam FolwarcznyAdam FolwarcznyScore: 55,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 08:1555,865473,159,890462,670,0001,016,0002,113,536
2Jun 29, 2026 08:1555,881473,894,044462,673,0001,147,0002,113,536
3Jun 29, 2026 08:1555,887473,185,675462,722,0001,146,0002,113,536
4Jun 29, 2026 08:1555,895473,287,409462,777,0001,159,0002,113,536
5Jun 29, 2026 08:1555,903473,456,270462,964,0001,036,0002,113,536
6Jun 29, 2026 08:1555,926473,481,841462,978,0001,211,0002,113,536
7Jun 29, 2026 08:1556,566478,817,895468,336,0001,167,0002,113,536
8Jun 29, 2026 08:1556,693479,949,062469,514,0001,038,0002,113,536
9Jun 29, 2026 08:1556,693479,940,425469,536,0001,024,0002,113,536