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 6, 2026 00:49TonyTonyScore: 8,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 00:507,94375,645,46063,434,0002,493,0002,113,536
2Aug 6, 2026 00:507,98376,048,62963,781,0002,483,0002,113,536
3Aug 6, 2026 00:507,98876,083,55763,775,0002,528,0002,113,536
4Aug 6, 2026 00:507,99576,161,73263,842,0002,521,0002,113,536
5Aug 6, 2026 00:508,01876,340,23264,062,0002,490,0002,113,536
6Aug 6, 2026 00:508,03176,499,35164,039,0002,626,0002,113,536
7Aug 6, 2026 00:508,05576,675,47864,197,0002,663,0002,113,536
8Aug 6, 2026 00:508,07586,965,36364,348,0002,681,0002,113,536
9Aug 6, 2026 00:508,10477,128,48664,589,0002,681,0002,113,536