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 7, 2026 21:31Victor MerckléVictor MerckléScore: 4,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 21:334,29144,166,88631,516,0004,100,00024,576stderr
2Sep 7, 2026 21:334,30144,935,87131,370,0004,332,0002,117,632stderr
3Sep 7, 2026 21:334,30244,907,45431,427,0004,284,00024,576stderr
4Sep 7, 2026 21:334,32645,072,85231,614,0004,293,00024,576stderr
5Sep 7, 2026 21:334,32845,164,03431,539,0004,387,00024,576stderr
6Sep 7, 2026 21:334,34644,406,70431,681,0004,395,00024,576stderr
7Sep 7, 2026 21:334,34845,280,22931,519,0004,576,00024,576stderr
8Sep 7, 2026 21:334,34945,297,92731,648,0004,456,00024,576stderr
9Sep 7, 2026 21:334,35644,884,80131,418,0004,742,0002,117,632stderr