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 11, 2026 19:45Victor MerckléVictor MerckléScore: 10,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 19:4910,15392,991,39183,057,0001,215,00024,576stderr
2Sep 11, 2026 19:4910,20193,344,23483,500,0001,171,00024,576stderr
3Sep 11, 2026 19:4910,26394,108,45383,670,0001,516,00024,576stderr
4Sep 11, 2026 19:4910,28294,678,29682,812,0002,529,0002,117,632stderr
5Sep 11, 2026 19:4910,31994,384,41183,967,0001,685,00024,576stderr
6Sep 11, 2026 19:4910,32395,503,45183,097,0002,585,0002,117,632stderr
7Sep 11, 2026 19:4910,36596,746,05683,050,0002,983,0002,117,632stderr
8Sep 11, 2026 19:4910,371100,840,64284,846,0001,241,00024,576stderr
9Sep 11, 2026 19:4910,39995,034,51783,487,0002,832,0002,117,632stderr