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 listMay 28, 2026 12:43Innokentii MeleshchenkoInnokentii MeleshchenkoScore: 240,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2026 12:43240,3462,004,262,5321,929,849,00065,031,0002,117,632
2May 28, 2026 12:43240,5562,009,091,7681,930,337,00066,279,0002,117,632
3May 28, 2026 12:43240,7332,009,392,9511,933,023,00065,067,0002,117,632
4May 28, 2026 12:43240,9312,011,199,8821,934,668,00065,063,0002,117,632
5May 28, 2026 12:43240,9372,019,810,9361,934,697,00065,088,0002,117,632
6May 28, 2026 12:43241,9992,019,665,1601,944,533,00064,066,0002,117,632
7May 28, 2026 12:43242,2132,022,007,4091,945,239,00065,129,0002,117,632
8May 28, 2026 12:43242,5252,024,433,1521,946,878,00066,080,0002,117,632
9May 28, 2026 12:43252,7062,107,134,7062,032,243,00065,220,0002,117,632