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 listMar 16, 2026 03:37zielajzielajScore: 3,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 03:363,56455,695,47228,565,0001,020,0002,519,040
2Mar 16, 2026 03:373,59660,032,57027,855,0001,989,0002,428,928
3Mar 16, 2026 03:363,59851,056,33627,871,0001,990,0002,514,944
4Mar 16, 2026 03:363,61554,070,52228,001,0002,000,0002,514,944
5Mar 16, 2026 03:373,62750,864,02228,095,0002,006,0002,519,040
6Mar 16, 2026 03:373,75456,798,61329,147,0002,010,0002,514,944