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 11, 2026 23:53Victor MerckléVictor MerckléScore: 3,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 23:543,89140,733,32931,287,0001,014,0002,117,632stderr
2Aug 11, 2026 23:543,89740,792,23531,327,0001,020,0002,117,632stderr
3Aug 11, 2026 23:543,90340,712,46931,380,0001,015,0002,117,632stderr
4Aug 11, 2026 23:543,90740,858,20531,412,0001,018,0002,117,632stderr
5Aug 11, 2026 23:543,90840,835,35631,424,0001,015,0002,117,632stderr
6Aug 11, 2026 23:543,92440,976,57831,553,0001,017,0002,117,632stderr
7Aug 11, 2026 23:543,94041,148,48631,684,0001,020,0002,117,632stderr
8Aug 11, 2026 23:543,94241,151,68331,702,0001,020,0002,117,632stderr
9Aug 11, 2026 23:543,96841,375,88331,922,0001,019,0002,117,632stderr