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 13, 2026 06:41e1011e1011Score: 57,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:4157,926492,145,975422,480,00058,308,0002,113,536
2Oct 13, 2026 06:4157,971492,551,753423,362,00057,805,0002,113,536
3Oct 13, 2026 06:4157,974491,759,831422,367,00058,824,0002,113,536
4Oct 13, 2026 06:4157,987491,823,568422,668,00058,627,0002,113,536
5Oct 13, 2026 06:4157,992492,555,562423,397,00057,937,0002,113,536
6Oct 13, 2026 06:4158,039492,396,370423,049,00058,676,0002,113,536
7Oct 13, 2026 06:4158,063492,492,530423,071,00058,857,0002,113,536
8Oct 13, 2026 06:4158,065492,526,057423,197,00058,747,0002,113,536
9Oct 13, 2026 06:4158,078492,627,681423,155,00058,895,0002,113,536