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 listSep 1, 2026 06:44Victor MerckléVictor MerckléScore: 3,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:453,63439,229,20829,008,0001,160,0002,117,632stderr
2Sep 1, 2026 06:453,63938,665,34429,039,0001,166,0002,117,632stderr
3Sep 1, 2026 06:453,64639,372,93729,108,0001,157,0002,117,632stderr
4Sep 1, 2026 06:453,65038,710,25629,185,0001,114,0002,117,632stderr
5Sep 1, 2026 06:453,65538,676,18829,204,0001,134,0002,117,632stderr
6Sep 1, 2026 06:453,68538,967,45729,571,0001,017,0002,117,632stderr
7Sep 1, 2026 06:453,69439,027,57029,548,0001,116,0002,117,632stderr
8Sep 1, 2026 06:453,69839,102,28229,574,0001,121,0002,117,632stderr
9Sep 1, 2026 06:453,72639,203,57429,863,0001,065,0002,117,632stderr