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 11, 2026 18:39Victor MerckléVictor MerckléScore: 3,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 18:433,86240,449,79031,017,0001,041,0002,117,632stderr
2Aug 11, 2026 18:433,86240,422,84330,954,0001,106,0002,117,632stderr
3Aug 11, 2026 18:433,86540,463,15931,051,0001,034,0002,117,632stderr
4Aug 11, 2026 18:433,86941,675,75230,979,0001,141,0002,117,632stderr
5Aug 11, 2026 18:433,87240,513,10031,115,0001,024,0002,117,632stderr
6Aug 11, 2026 18:433,88040,579,22431,062,0001,145,0002,117,632stderr
7Aug 11, 2026 18:433,89040,731,91031,239,0001,050,0002,117,632stderr
8Aug 11, 2026 18:433,93741,110,27631,625,0001,058,0002,117,632stderr
9Aug 11, 2026 18:434,00741,713,31632,197,0001,062,0002,117,632stderr