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 28, 2026 19:27Victor MerckléVictor MerckléScore: 4,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:274,90249,778,92239,672,0001,020,0002,117,632stderr
2Aug 28, 2026 19:274,90749,728,44639,714,0001,021,0002,117,632stderr
3Aug 28, 2026 19:274,90749,636,82739,712,0001,019,0002,117,632stderr
4Aug 28, 2026 19:274,91649,761,17639,787,0001,023,0002,117,632stderr
5Aug 28, 2026 19:274,93650,040,13339,940,0001,032,0002,117,632stderr
6Aug 28, 2026 19:274,95950,261,62640,140,0001,020,0002,117,632stderr
7Aug 28, 2026 19:274,97050,278,50940,229,0001,024,0002,117,632stderr
8Aug 28, 2026 19:275,02150,749,95540,658,0001,021,0002,117,632stderr
9Aug 28, 2026 19:275,10050,591,75741,307,0001,030,0002,117,632stderr