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 27, 2026 05:57Victor MerckléVictor MerckléScore: 4,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:584,26543,816,38134,262,0001,143,0002,117,632stderr
2Aug 27, 2026 05:584,26945,029,22434,300,0001,134,0002,117,632stderr
3Aug 27, 2026 05:584,27143,787,20534,348,0001,109,0002,117,632stderr
4Aug 27, 2026 05:584,27443,853,17934,350,0001,129,0002,117,632stderr
5Aug 27, 2026 05:584,30844,061,84034,666,0001,098,0002,117,632stderr
6Aug 27, 2026 05:584,34644,473,70934,937,0001,135,0002,117,632stderr
7Aug 27, 2026 05:584,37245,303,36035,122,0001,171,0002,117,632stderr
8Aug 27, 2026 05:584,41845,045,51835,570,0001,102,0002,117,632stderr
9Aug 27, 2026 05:584,45945,421,51335,888,0001,128,0002,117,632stderr