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 5, 2026 02:03FrederickFrederickScore: 8,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:048,47781,543,48168,356,0002,009,0002,117,632
2Oct 5, 2026 02:048,58183,417,14969,187,0002,037,0002,117,632
3Oct 5, 2026 02:048,65382,233,17869,791,0002,037,0002,117,632
4Oct 5, 2026 02:048,68582,649,56070,062,0002,029,0002,117,632
5Oct 5, 2026 02:048,74883,793,38270,574,0002,040,0002,117,632
6Oct 5, 2026 02:048,76183,126,00670,700,0002,020,0002,117,632
7Oct 5, 2026 02:048,87784,107,02171,670,0002,013,0002,117,632
8Oct 5, 2026 02:048,92684,517,74472,051,0002,043,0002,117,632
9Oct 5, 2026 02:049,01685,272,48672,772,0002,063,0002,117,632