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 listAug 25, 2026 02:37Victor MerckléVictor MerckléScore: 9,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:388,88582,135,39972,603,0001,147,0002,117,632stderr
2Aug 25, 2026 02:388,89682,226,73272,693,0001,149,0002,117,632stderr
3Aug 25, 2026 02:388,90182,279,94972,734,0001,147,0002,117,632stderr
4Aug 25, 2026 02:388,90982,385,31972,795,0001,153,0002,117,632stderr
5Aug 25, 2026 02:389,06283,615,53774,116,0001,105,0002,117,632stderr
6Aug 25, 2026 02:389,08383,790,28374,299,0001,098,0002,117,632stderr
7Aug 25, 2026 02:389,16284,450,19974,929,0001,121,0002,117,632stderr
8Aug 25, 2026 02:389,16385,038,15574,934,0001,123,0002,117,632stderr
9Aug 25, 2026 02:389,26185,220,22675,742,0001,129,0002,117,632stderr