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 22, 2026 11:44Dominique GarmierDominique GarmierScore: 8,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 11:448,82899,413,45471,264,0002,007,0002,306,048
2Mar 22, 2026 11:438,867102,080,51571,581,0002,016,0002,555,904
3Mar 22, 2026 11:438,916100,905,35973,004,0001,000,0002,310,144
4Mar 22, 2026 11:448,927104,903,88372,096,0002,002,0002,301,952
5Mar 22, 2026 11:438,99794,849,94272,688,0001,991,0002,293,760
6Mar 22, 2026 11:449,093104,897,54373,487,0001,986,0002,347,008