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 listOct 16, 2026 18:19KacpxerKacpxerScore: 7,376Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 16:26Andrew Epstein20.69CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:197,27871,831,00659,279,0001,129,0002,113,536
2Oct 16, 2026 18:197,29374,533,18859,389,0001,148,0002,113,536
3Oct 16, 2026 18:197,33971,584,53959,805,0001,111,0002,113,536
4Oct 16, 2026 18:197,35072,324,20259,854,0001,155,0002,113,536
5Oct 16, 2026 18:197,37671,950,61760,072,0001,151,0002,113,536
6Oct 16, 2026 18:197,44372,469,53560,630,0001,153,0002,113,536
7Oct 16, 2026 18:197,55673,511,31161,575,0001,145,0002,113,536
8Oct 16, 2026 18:197,56873,580,30361,691,0001,130,0002,113,536
9Oct 16, 2026 18:198,08478,441,50365,943,0001,161,0002,113,536