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 12, 2026 19:43e1011e1011Score: 2,040,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 19:452,038,27816,929,235,47216,851,614,00066,095,0002,113,536
2Oct 12, 2026 19:452,039,32216,937,096,01816,861,338,00065,037,0002,113,536
3Oct 12, 2026 19:452,040,02316,943,255,94916,868,151,00064,040,0002,113,536
4Oct 12, 2026 19:452,040,20116,944,392,10616,869,629,00064,044,0002,113,536
5Oct 12, 2026 19:452,040,57816,948,194,58716,870,761,00066,039,0002,113,536
6Oct 12, 2026 19:452,040,66416,949,174,43816,870,452,00067,060,0002,113,536
7Oct 12, 2026 19:452,041,59116,957,472,41116,878,168,00067,040,0002,113,536
8Oct 12, 2026 19:452,045,23716,986,269,15516,910,441,00065,034,0002,113,536
9Oct 12, 2026 19:452,122,12317,624,496,13517,548,586,00065,037,0002,113,536