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 10, 2026 23:02Josu San MartinJosu San MartinScore: 5,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 23:025,47468,073,68744,422,0001,009,0002,281,472
2Mar 10, 2026 23:025,54069,927,27043,986,0001,999,0002,420,736
3Mar 10, 2026 23:025,58866,160,00845,370,0001,008,0002,506,752
4Mar 10, 2026 23:025,61271,370,38745,566,0001,012,0002,433,024
5Mar 10, 2026 23:025,61971,581,95045,645,000992,0002,281,472
6Mar 10, 2026 23:025,82373,187,47947,323,0001,006,0002,281,472