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 listSep 23, 2026 12:07Kevin HeaveyKevin HeaveyScore: 3,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 12:093,20136,640,40725,544,0001,032,00020,480
2Sep 23, 2026 12:093,20336,909,76725,581,0001,009,00020,480
3Sep 23, 2026 12:093,20536,675,00025,598,0001,008,00020,480
4Sep 23, 2026 12:093,20737,131,51125,620,0001,003,00020,480
5Sep 23, 2026 12:093,21236,638,39625,663,0001,003,00020,480
6Sep 23, 2026 12:093,22237,615,23225,741,0001,002,00020,480
7Sep 23, 2026 12:093,22536,787,50325,736,0001,035,00020,480
8Sep 23, 2026 12:093,23135,542,02225,804,0001,014,00020,480
9Sep 23, 2026 12:093,25737,467,50126,017,0001,023,00020,480