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 12, 2026 01:11Victor MerckléVictor MerckléScore: 3,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 01:123,73940,530,72429,919,0001,120,0002,117,632stderr
2Aug 12, 2026 01:123,75039,711,37630,007,0001,122,0002,117,632stderr
3Aug 12, 2026 01:123,75439,616,35129,992,0001,170,0002,117,632stderr
4Aug 12, 2026 01:123,76339,546,89030,106,0001,135,0002,117,632stderr
5Aug 12, 2026 01:123,76640,432,66730,085,0001,174,0002,117,632stderr
6Aug 12, 2026 01:123,76939,726,08430,172,0001,116,0002,117,632stderr
7Aug 12, 2026 01:123,77440,419,22030,157,0001,174,0002,117,632stderr
8Aug 12, 2026 01:123,77739,743,86730,211,0001,143,0002,117,632stderr
9Aug 12, 2026 01:123,81040,037,49130,548,0001,078,0002,117,632stderr