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 12, 2026 04:40Victor MerckléVictor MerckléScore: 4,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 04:414,36244,673,11435,044,0001,163,0002,117,632stderr
2Aug 12, 2026 04:414,36344,582,06335,127,0001,086,0002,117,632stderr
3Aug 12, 2026 04:414,37244,710,87435,148,0001,143,0002,117,632stderr
4Aug 12, 2026 04:414,39444,886,96635,429,0001,044,0002,117,632stderr
5Aug 12, 2026 04:414,39544,947,16035,402,0001,077,0002,117,632stderr
6Aug 12, 2026 04:414,40245,023,77235,433,0001,108,0002,117,632stderr
7Aug 12, 2026 04:414,55346,286,47636,704,0001,090,0002,117,632stderr
8Aug 12, 2026 04:414,56846,295,10936,852,0001,070,0002,117,632stderr
9Aug 12, 2026 04:414,61446,720,25637,251,0001,046,0002,117,632stderr