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 2, 2026 08:33George SeabridgeGeorge SeabridgeScore: 69,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 08:3469,501586,807,215575,790,0001,070,0002,113,536
2Aug 2, 2026 08:3469,659588,240,505577,073,0001,097,0002,113,536
3Aug 2, 2026 08:3469,700589,190,142577,408,0001,102,0002,113,536
4Aug 2, 2026 08:3469,752588,867,268577,856,0001,088,0002,113,536
5Aug 2, 2026 08:3469,812589,361,045578,322,0001,125,0002,113,536
6Aug 2, 2026 08:3469,860589,750,011578,750,0001,090,0002,113,536
7Aug 2, 2026 08:3495,674804,024,764793,022,0001,079,0002,113,536
8Aug 2, 2026 08:34101,705854,148,445843,065,0001,094,0002,113,536
9Aug 2, 2026 08:34102,767862,907,476851,894,0001,078,0002,113,536