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 9, 2026 13:45Victor MerckléVictor MerckléScore: 37,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 13:4837,109316,746,548306,937,0001,074,0002,117,632stderr
2Sep 9, 2026 13:4837,130316,814,428307,147,0001,035,0002,117,632stderr
3Sep 9, 2026 13:4837,249318,106,799308,149,0001,024,0002,117,632stderr
4Sep 9, 2026 13:4837,249318,486,615308,163,0001,007,0002,117,632stderr
5Sep 9, 2026 13:4837,277318,075,547308,351,0001,050,0002,117,632stderr
6Sep 9, 2026 13:4837,287318,121,102308,360,0001,123,0002,117,632stderr
7Sep 9, 2026 13:4837,355319,405,854308,924,0001,124,0002,117,632stderr
8Sep 9, 2026 13:4837,441320,048,164309,638,0001,125,0002,117,632stderr
9Sep 9, 2026 13:4837,444320,993,026309,763,0001,030,0002,117,632stderr