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 listSep 29, 2026 17:08parastromparastromScore: 4,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 17:104,03642,456,68132,491,0001,013,0002,113,536
2Sep 29, 2026 17:104,04842,602,55032,486,0001,120,0002,113,536
3Sep 29, 2026 17:104,05942,678,01232,567,0001,127,0002,113,536
4Sep 29, 2026 17:104,06142,684,68432,654,0001,057,0002,113,536
5Sep 29, 2026 17:104,07942,911,09132,723,0001,133,0002,113,536
6Sep 29, 2026 17:104,08342,839,62532,804,0001,087,0002,113,536
7Sep 29, 2026 17:104,08642,878,67632,777,0001,137,0002,113,536
8Sep 29, 2026 17:104,10743,079,70933,004,0001,087,0002,113,536
9Sep 29, 2026 17:104,24544,225,86834,077,0001,159,0002,113,536