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 00:04Victor MerckléVictor MerckléScore: 3,997Success
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 00:053,97041,298,85231,840,0001,117,0002,117,632stderr
2Aug 11, 2026 00:053,97941,374,74131,851,0001,182,0002,117,632stderr
3Aug 11, 2026 00:053,99442,190,22931,989,0001,169,0002,117,632stderr
4Aug 11, 2026 00:053,99642,263,34731,962,0001,212,0002,117,632stderr
5Aug 11, 2026 00:053,99741,491,96332,073,0001,109,0002,117,632stderr
6Aug 11, 2026 00:053,99841,577,28732,084,0001,106,0002,117,632stderr
7Aug 11, 2026 00:054,04241,885,30032,461,0001,094,0002,117,632stderr
8Aug 11, 2026 00:054,06042,096,18532,598,0001,107,0002,117,632stderr
9Aug 11, 2026 00:054,06542,727,31732,579,0001,161,0002,117,632stderr