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 listAug 1, 2026 15:27George SeabridgeGeorge SeabridgeScore: 6,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 15:286,96468,586,87356,730,0001,079,0002,113,536
2Aug 1, 2026 15:286,96667,820,81556,737,0001,086,0002,113,536
3Aug 1, 2026 15:286,96967,826,61856,759,0001,088,0002,113,536
4Aug 1, 2026 15:286,97068,573,11856,768,0001,084,0002,113,536
5Aug 1, 2026 15:286,97367,973,36056,792,0001,087,0002,113,536
6Aug 1, 2026 15:286,97567,920,36156,808,0001,090,0002,113,536
7Aug 1, 2026 15:286,98868,047,49056,900,0001,108,0002,113,536
8Aug 1, 2026 15:287,32871,704,27659,747,0001,082,0002,113,536
9Aug 1, 2026 15:287,33471,657,46659,761,0001,113,0002,113,536