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 27, 2026 02:25Victor MerckléVictor MerckléScore: 4,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:254,16043,072,76733,423,0001,112,0002,113,536
2Aug 27, 2026 02:254,16842,707,10833,501,0001,097,0002,113,536
3Aug 27, 2026 02:254,16942,944,58733,479,0001,126,0002,113,536
4Aug 27, 2026 02:254,17043,040,08733,508,0001,109,0002,113,536
5Aug 27, 2026 02:254,17743,012,76933,618,0001,059,0002,113,536
6Aug 27, 2026 02:254,18043,045,48533,575,0001,119,0002,113,536
7Aug 27, 2026 02:254,18543,099,43233,670,0001,070,0002,113,536
8Aug 27, 2026 02:254,19843,987,81133,536,0001,313,0002,113,536
9Aug 27, 2026 02:254,21044,444,77733,821,0001,129,0002,113,536