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 22:12Victor MerckléVictor MerckléScore: 4,086Success
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 22:134,03141,766,13029,445,0004,015,00024,576stderr
2Sep 7, 2026 22:134,03341,784,12129,377,0004,104,00024,576stderr
3Sep 7, 2026 22:134,06842,426,10829,362,0004,406,00024,576stderr
4Sep 7, 2026 22:134,08442,465,59429,605,0004,293,00024,576stderr
5Sep 7, 2026 22:134,08642,262,36329,574,0004,348,00024,576stderr
6Sep 7, 2026 22:134,08743,139,70729,409,0004,517,00024,576stderr
7Sep 7, 2026 22:134,08742,241,09729,430,0004,497,00024,576stderr
8Sep 7, 2026 22:134,09442,573,63829,413,0004,569,00024,576stderr
9Sep 7, 2026 22:134,11042,678,43729,566,0004,553,00024,576stderr