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:17KacpxerKacpxerScore: 9,089Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 16:21Andrew Epstein27.18CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:178,67483,829,29870,782,0001,217,0002,113,536
2Oct 16, 2026 18:178,68182,552,32170,828,0001,232,0002,113,536
3Oct 16, 2026 18:178,68383,134,48771,040,0001,029,0002,113,536
4Oct 16, 2026 18:178,98685,101,23373,422,0001,169,0002,113,536
5Oct 16, 2026 18:179,08986,585,82674,289,0001,157,0002,113,536
6Oct 16, 2026 18:179,13986,854,10474,700,0001,160,0002,113,536
7Oct 16, 2026 18:179,38488,549,12176,741,0001,151,0002,113,536
8Oct 16, 2026 18:179,38888,451,59876,750,0001,171,0002,113,536
9Oct 16, 2026 18:179,46289,099,66577,380,0001,162,0002,113,536