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 28, 2026 18:55BrillentypBrillentypScore: 440,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 18:55416,05017,125,132,472963,786,0002,489,430,0002,461,696
2Mar 28, 2026 18:55440,00917,437,919,8821,045,103,0002,606,969,0002,461,696
3Mar 28, 2026 18:55452,73215,858,696,7691,192,949,0002,564,726,0002,514,944