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 8, 2026 05:47caandocaandoScore: 9,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 05:478,04893,651,55065,805,000997,0002,519,040
2Mar 8, 2026 05:478,05888,307,21864,887,0001,996,0002,281,472
3Mar 8, 2026 05:478,08092,567,63065,064,0002,001,0002,281,472
4Mar 8, 2026 05:479,01698,475,74673,835,000997,0002,281,472
5Mar 8, 2026 05:479,01799,704,60672,848,0001,995,0002,269,184
6Mar 8, 2026 05:479,02399,221,30772,894,0001,997,0002,281,472