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 17:37Victor MerckléVictor MerckléScore: 5,134Success
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 17:404,80748,432,76732,916,0006,989,00024,576stderr
2Sep 7, 2026 17:405,00550,830,45433,845,0007,702,0002,121,728stderr
3Sep 7, 2026 17:405,01450,183,49433,549,0008,074,0002,117,632stderr
4Sep 7, 2026 17:405,06050,620,28435,875,0006,123,00024,576stderr
5Sep 7, 2026 17:405,13451,177,95434,581,0008,035,00024,576stderr
6Sep 7, 2026 17:405,18051,581,48636,616,0006,382,00024,576stderr
7Sep 7, 2026 17:405,52754,516,18736,258,0009,621,0002,117,632stderr
8Sep 7, 2026 17:405,61755,278,47236,654,0009,969,00024,576stderr
9Sep 7, 2026 17:405,85257,169,89936,190,00012,389,0002,117,632stderr