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 listApr 4, 2026 01:38aLaLScore: 2,067,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 01:382,062,96117,157,260,53617,046,607,00075,967,0002,281,472
2Apr 4, 2026 01:382,064,93017,174,424,47517,081,948,00056,973,0002,281,472
3Apr 4, 2026 01:382,065,98417,182,132,09817,067,703,00079,961,0002,281,472
4Apr 4, 2026 01:382,067,70717,195,855,36817,075,011,00086,959,0002,281,472
5Apr 4, 2026 01:382,067,80017,194,718,23517,092,772,00069,966,0002,281,472
6Apr 4, 2026 01:382,069,12417,208,636,10617,097,768,00075,963,0002,281,472
7Apr 4, 2026 01:382,069,25217,210,263,15517,106,821,00067,967,0002,277,376
8Apr 4, 2026 01:382,070,90417,219,732,82717,111,530,00076,970,0002,281,472
9Apr 4, 2026 01:382,075,95317,264,272,51117,162,444,00067,970,0002,281,472