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 30, 2026 18:24Josu San MartinJosu San MartinScore: 4,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:244,32744,337,23234,807,0001,112,0002,113,536
2Aug 30, 2026 18:244,32844,362,79834,821,0001,108,0002,113,536
3Aug 30, 2026 18:244,33144,461,93734,829,0001,122,0002,113,536
4Aug 30, 2026 18:244,33544,502,57734,865,0001,121,0002,113,536
5Aug 30, 2026 18:244,34844,628,04035,036,0001,055,0002,113,536
6Aug 30, 2026 18:244,35844,679,41835,060,0001,118,0002,113,536
7Aug 30, 2026 18:244,36544,628,06435,117,0001,116,0002,113,536
8Aug 30, 2026 18:244,37044,761,92435,163,0001,113,0002,113,536
9Aug 30, 2026 18:244,37344,756,75835,190,0001,114,0002,113,536