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 listMay 20, 2026 19:33Victor MerckléVictor MerckléScore: 5,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:365,35153,775,45943,296,0001,124,0002,117,632stderr
2May 20, 2026 19:365,36954,365,16643,524,0001,040,0002,117,632stderr
3May 20, 2026 19:365,37052,320,32043,541,0001,034,0002,117,632stderr
4May 20, 2026 19:365,38155,392,70743,589,0001,074,0002,117,632stderr
5May 20, 2026 19:365,39054,212,36943,694,0001,046,0002,117,632stderr
6May 20, 2026 19:365,39554,483,25143,724,0001,056,0002,117,632stderr
7May 20, 2026 19:365,40555,495,28743,797,0001,068,0002,117,632stderr
8May 20, 2026 19:365,42353,164,90843,883,0001,132,0002,117,632stderr
9May 20, 2026 19:365,44754,925,40044,155,0001,057,0002,117,632stderr