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 24, 2026 21:09Victor MerckléVictor MerckléScore: 4,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 21:104,33244,987,43034,848,0001,115,0002,117,632stderr
2Aug 24, 2026 21:104,35944,536,59735,085,0001,097,0002,117,632stderr
3Aug 24, 2026 21:104,36345,339,51835,098,0001,121,0002,117,632stderr
4Aug 24, 2026 21:104,37344,721,14335,227,0001,070,0002,117,632stderr
5Aug 24, 2026 21:104,38144,858,47135,263,0001,106,0002,117,632stderr
6Aug 24, 2026 21:104,38444,740,55035,266,0001,123,0002,117,632stderr
7Aug 24, 2026 21:104,40945,621,58535,411,0001,191,0002,117,632stderr
8Aug 24, 2026 21:104,43145,166,80035,712,0001,070,0002,117,632stderr
9Aug 24, 2026 21:104,67447,853,47637,747,0001,053,0002,117,632stderr