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 12, 2026 03:08Victor MerckléVictor MerckléScore: 3,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 03:093,76939,758,00030,183,0001,101,0002,117,632stderr
2Aug 12, 2026 03:093,77739,745,58430,254,0001,100,0002,117,632stderr
3Aug 12, 2026 03:093,78139,791,87230,295,0001,091,0002,117,632stderr
4Aug 12, 2026 03:093,78339,802,87430,302,0001,102,0002,117,632stderr
5Aug 12, 2026 03:093,79839,921,07730,440,0001,090,0002,117,632stderr
6Aug 12, 2026 03:093,80340,003,95630,465,0001,108,0002,117,632stderr
7Aug 12, 2026 03:093,80939,960,79530,432,0001,185,0002,117,632stderr
8Aug 12, 2026 03:093,84440,289,79330,843,0001,070,0002,117,632stderr
9Aug 12, 2026 03:093,84640,258,93730,839,0001,091,0002,117,632stderr