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 19, 2026 15:10Victor MerckléVictor MerckléScore: 40,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 15:1138,575328,116,707304,336,00015,841,0002,113,536
2May 19, 2026 15:1140,609346,817,306322,988,00014,070,0002,113,536
3May 19, 2026 15:1140,611346,823,008322,947,00014,128,0002,113,536
4May 19, 2026 15:1140,646345,909,232322,828,00014,534,0002,113,536
5May 19, 2026 15:1140,683347,155,503323,135,00014,536,0002,113,536
6May 19, 2026 15:1140,701345,764,949323,040,00014,783,0002,113,536
7May 19, 2026 15:1140,734347,896,433323,847,00014,249,0002,113,536
8May 19, 2026 15:1140,766347,744,381323,665,00014,695,0002,113,536
9May 19, 2026 15:1140,902349,257,051323,322,00016,172,0002,113,536