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 13:12George SeabridgeGeorge SeabridgeScore: 7,659Success
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 13:136,80866,557,69055,436,0001,075,0002,113,536
2Aug 1, 2026 13:136,81466,581,75655,477,0001,084,0002,113,536
3Aug 1, 2026 13:136,81766,600,93355,506,0001,082,0002,113,536
4Aug 1, 2026 13:136,82266,576,85655,542,0001,084,0002,113,536
5Aug 1, 2026 13:137,65974,793,69962,432,0001,144,0002,113,536
6Aug 1, 2026 13:138,12177,377,25566,396,0001,015,0002,113,536
7Aug 1, 2026 13:138,12377,492,41666,250,0001,172,0002,113,536
8Aug 1, 2026 13:138,15077,709,51166,564,0001,085,0002,113,536
9Aug 1, 2026 13:138,15777,687,90566,545,0001,160,0002,113,536