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 12:17Victor MerckléVictor MerckléScore: 3,806Success
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 12:183,76139,647,85330,076,0001,147,0002,117,632stderr
2Aug 12, 2026 12:183,77039,749,42130,199,0001,093,0002,117,632stderr
3Aug 12, 2026 12:183,79839,924,49030,415,0001,114,0002,117,632stderr
4Aug 12, 2026 12:183,80439,926,83230,446,0001,129,0002,117,632stderr
5Aug 12, 2026 12:183,80640,022,18130,515,0001,083,0002,117,632stderr
6Aug 12, 2026 12:183,83240,167,50330,621,0001,185,0002,117,632stderr
7Aug 12, 2026 12:183,83740,269,27130,715,0001,140,0002,117,632stderr
8Aug 12, 2026 12:183,85140,391,78430,878,0001,089,0002,117,632stderr
9Aug 12, 2026 12:183,94341,132,92731,646,0001,082,0002,117,632stderr