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 07:34Victor MerckléVictor MerckléScore: 3,793Success
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 07:343,74540,074,24829,859,0001,226,0002,117,632stderr
2Sep 1, 2026 07:343,74839,383,01528,960,0002,152,0002,117,632stderr
3Sep 1, 2026 07:343,77740,393,15230,145,0001,212,0002,117,632stderr
4Sep 1, 2026 07:343,78340,123,75829,333,0002,074,0002,117,632stderr
5Sep 1, 2026 07:343,79339,764,54230,259,0001,224,0002,117,632stderr
6Sep 1, 2026 07:343,80740,620,25530,397,0001,209,0002,117,632stderr
7Sep 1, 2026 07:343,84540,271,64429,907,0002,007,0002,117,632stderr
8Sep 1, 2026 07:343,87040,237,46331,000,0001,129,0002,117,632stderr
9Sep 1, 2026 07:343,87540,470,69030,131,0002,038,0002,117,632stderr