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:41George SeabridgeGeorge SeabridgeScore: 8,162Success
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:416,82066,659,34155,542,0001,071,0002,113,536
2Aug 1, 2026 13:416,82166,614,70855,545,0001,074,0002,113,536
3Aug 1, 2026 13:418,14977,650,11266,541,0001,096,0002,113,536
4Aug 1, 2026 13:418,16077,762,79366,640,0001,096,0002,113,536
5Aug 1, 2026 13:418,16277,707,75666,644,0001,103,0002,113,536
6Aug 1, 2026 13:418,17379,442,27666,737,0001,104,0002,113,536
7Aug 1, 2026 13:418,17478,629,26066,629,0001,217,0002,113,536
8Aug 1, 2026 13:418,18578,656,40966,830,0001,108,0002,113,536
9Aug 1, 2026 13:418,19878,038,87866,926,0001,118,0002,113,536