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 01:59Victor MerckléVictor MerckléScore: 5,127Success
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 01:595,09850,573,40741,287,0001,031,0002,117,632stderr
2Aug 27, 2026 01:595,10350,587,76141,342,0001,013,0002,117,632stderr
3Aug 27, 2026 01:595,10650,699,63041,371,0001,016,0002,117,632stderr
4Aug 27, 2026 01:595,12550,963,16741,525,0001,018,0002,117,632stderr
5Aug 27, 2026 01:595,12750,850,25641,536,0001,019,0002,117,632stderr
6Aug 27, 2026 01:595,13850,993,97341,629,0001,018,0002,117,632stderr
7Aug 27, 2026 01:595,17451,259,85441,938,0001,014,0002,117,632stderr
8Aug 27, 2026 01:595,18051,936,56741,977,0001,019,0002,117,632stderr
9Aug 27, 2026 01:595,30952,382,74443,050,0001,015,0002,117,632stderr