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 25, 2026 01:45Victor MerckléVictor MerckléScore: 3,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:453,83640,176,84430,745,0001,102,0002,117,632stderr
2Aug 25, 2026 01:453,86940,475,82831,066,0001,051,0002,117,632stderr
3Aug 25, 2026 01:453,88240,648,28431,064,0001,160,0002,117,632stderr
4Aug 25, 2026 01:453,88540,537,05631,102,0001,144,0002,117,632stderr
5Aug 25, 2026 01:453,88740,553,56231,169,0001,097,0002,117,632stderr
6Aug 25, 2026 01:453,89740,821,79231,213,0001,137,0002,117,632stderr
7Aug 25, 2026 01:453,89840,720,23331,269,0001,090,0002,117,632stderr
8Aug 25, 2026 01:453,90940,843,80431,252,0001,196,0002,117,632stderr
9Aug 25, 2026 01:453,95341,201,31131,730,0001,084,0002,117,632stderr