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 01:26Victor MerckléVictor MerckléScore: 5,319Success
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 01:265,20052,220,98342,060,0001,104,0002,113,536
2Aug 27, 2026 01:265,21451,452,05742,192,0001,090,0002,113,536
3Aug 27, 2026 01:265,27052,080,15042,697,0001,051,0002,113,536
4Aug 27, 2026 01:265,28652,232,90342,818,0001,061,0002,113,536
5Aug 27, 2026 01:265,31953,198,38243,103,0001,052,0002,113,536
6Aug 27, 2026 01:265,32352,379,97943,080,0001,101,0002,113,536
7Aug 27, 2026 01:265,34852,591,60143,315,0001,080,0002,113,536
8Aug 27, 2026 01:265,38253,074,07243,648,0001,029,0002,113,536
9Aug 27, 2026 01:265,55955,216,79845,073,0001,073,0002,113,536