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 05:53Victor MerckléVictor MerckléScore: 6,578Success
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 05:546,46062,050,60047,142,0006,476,00024,576stderr
2Sep 8, 2026 05:546,53663,199,08847,775,0006,474,00024,576stderr
3Sep 8, 2026 05:546,55662,869,60447,847,0006,571,00024,576stderr
4Sep 8, 2026 05:546,56162,913,08947,868,0006,593,00024,576stderr
5Sep 8, 2026 05:546,57863,097,84448,101,0006,500,00024,576stderr
6Sep 8, 2026 05:546,59163,217,69747,089,0007,618,00024,576stderr
7Sep 8, 2026 05:546,66163,818,09747,835,0007,452,00024,576stderr
8Sep 8, 2026 05:546,66263,767,44048,468,0006,828,00024,576stderr
9Sep 8, 2026 05:546,80565,028,21448,075,0008,413,0002,117,632stderr