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 8, 2026 13:37Victor MerckléVictor MerckléScore: 30,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 13:4130,251259,525,608242,629,0008,462,00028,672stderr
2Sep 8, 2026 13:4130,309260,003,391242,268,0009,300,00028,672stderr
3Sep 8, 2026 13:4130,317260,108,112243,111,0008,528,00028,672stderr
4Sep 8, 2026 13:4130,327260,165,524243,160,0008,559,00028,672stderr
5Sep 8, 2026 13:4130,413260,891,703243,389,0009,044,0002,121,728stderr
6Sep 8, 2026 13:4130,417260,949,514243,715,0008,752,00028,672stderr
7Sep 8, 2026 13:4130,423261,743,128243,495,0009,017,00028,672stderr
8Sep 8, 2026 13:4130,452261,873,963243,385,0009,368,00028,672stderr
9Sep 8, 2026 13:4130,502261,614,591244,104,0009,064,0002,121,728stderr