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:48Victor MerckléVictor MerckléScore: 9,801Success
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:489,67788,718,15379,276,0001,051,0002,113,536
2Aug 27, 2026 01:489,74088,965,21279,773,0001,075,0002,113,536
3Aug 27, 2026 01:489,74289,228,13579,830,0001,034,0002,113,536
4Aug 27, 2026 01:489,76489,417,23780,003,0001,039,0002,113,536
5Aug 27, 2026 01:489,80189,688,00180,317,0001,032,0002,113,536
6Aug 27, 2026 01:4810,11992,356,31382,941,0001,054,0002,113,536
7Aug 27, 2026 01:4810,13892,514,18683,124,0001,024,0002,113,536
8Aug 27, 2026 01:4810,15693,342,17183,249,0001,048,0002,113,536
9Aug 27, 2026 01:4810,16392,737,02183,305,0001,049,0002,113,536