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 listMay 24, 2026 11:43Victor MerckléVictor MerckléScore: 23,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 11:4723,609203,926,328194,957,0001,003,0002,117,632stderr
2May 24, 2026 11:4723,678206,039,842195,528,0001,001,0002,117,632stderr
3May 24, 2026 11:4723,688206,465,868195,612,0001,001,0002,117,632stderr
4May 24, 2026 11:4723,922206,396,846197,555,0001,001,0002,117,632stderr
5May 24, 2026 11:4723,971207,277,701197,872,0001,093,0002,117,632stderr
6May 24, 2026 11:4723,978206,770,674198,020,0001,001,0002,117,632stderr
7May 24, 2026 11:4723,992206,984,106198,064,0001,070,0002,117,632stderr
8May 24, 2026 11:4724,019207,786,061198,272,0001,086,0002,117,632stderr
9May 24, 2026 11:4724,234211,263,384200,074,0001,070,0002,117,632stderr