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 listApr 26, 2026 03:10zielajzielajScore: 3,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 03:103,45647,157,36227,662,0001,024,0002,424,832
2Apr 26, 2026 03:103,46147,477,07427,708,0001,026,0002,424,832
3Apr 26, 2026 03:103,53550,772,34928,330,0001,011,0002,416,640
4Apr 26, 2026 03:103,54249,661,16628,387,0001,013,0002,420,736
5Apr 26, 2026 03:103,54344,636,99829,408,00002,310,144
6Apr 26, 2026 03:103,61448,083,91028,004,0002,000,0002,424,832
7Apr 26, 2026 03:103,62243,791,30728,063,0002,004,0002,428,928
8Apr 26, 2026 03:103,63048,321,22829,132,0001,004,0002,416,640
9Apr 26, 2026 03:103,64649,521,90929,256,0001,008,0002,420,736