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 13, 2026 01:39Victor MerckléVictor MerckléScore: 46,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 01:4045,238385,957,567374,451,0001,029,0002,117,632stderr
2Aug 13, 2026 01:4045,249385,506,034374,532,0001,036,0002,117,632stderr
3Aug 13, 2026 01:4045,636388,701,029377,671,0001,108,0002,117,632stderr
4Aug 13, 2026 01:4046,014391,849,788380,819,0001,103,0002,117,632stderr
5Aug 13, 2026 01:4046,029391,948,610380,947,0001,101,0002,117,632stderr
6Aug 13, 2026 01:4046,111392,625,106381,549,0001,180,0002,117,632stderr
7Aug 13, 2026 01:4046,121392,775,402381,763,0001,048,0002,117,632stderr
8Aug 13, 2026 01:4046,145393,092,684381,870,0001,138,0002,117,632stderr
9Aug 13, 2026 01:4046,148393,034,726381,934,0001,096,0002,117,632stderr