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 08:17Victor MerckléVictor MerckléScore: 4,700Success
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 08:204,64847,178,20930,831,0007,750,00024,576stderr
2Sep 8, 2026 08:204,65247,148,01030,976,0007,636,00024,576stderr
3Sep 8, 2026 08:204,65547,784,08030,886,0007,754,0002,117,632stderr
4Sep 8, 2026 08:204,67947,412,57631,070,0007,770,0002,117,632stderr
5Sep 8, 2026 08:204,70047,795,02131,247,0007,766,00024,576stderr
6Sep 8, 2026 08:204,77348,798,85631,358,0008,265,00024,576stderr
7Sep 8, 2026 08:204,85348,730,28032,612,0007,668,0002,117,632stderr
8Sep 8, 2026 08:204,90049,799,58332,385,0008,287,00024,576stderr
9Sep 8, 2026 08:204,92450,024,99832,216,0008,655,00024,576stderr