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 16:17Victor MerckléVictor MerckléScore: 4,578Success
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 16:184,55046,176,68236,688,0001,083,0002,117,632stderr
2Aug 11, 2026 16:184,55246,176,57436,766,0001,018,0002,117,632stderr
3Aug 11, 2026 16:184,56546,312,05036,795,0001,100,0002,117,632stderr
4Aug 11, 2026 16:184,56946,312,72436,894,0001,035,0002,117,632stderr
5Aug 11, 2026 16:184,57846,377,89536,987,0001,015,0002,117,632stderr
6Aug 11, 2026 16:184,58146,426,57736,936,0001,089,0002,117,632stderr
7Aug 11, 2026 16:184,63146,885,17337,342,0001,099,0002,117,632stderr
8Aug 11, 2026 16:184,71447,577,44537,892,0001,241,0002,117,632stderr
9Aug 11, 2026 16:184,79648,193,73138,790,0001,022,0002,117,632stderr