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 24, 2026 17:39Victor MerckléVictor MerckléScore: 4,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:404,73647,430,08938,208,0001,103,0002,117,632stderr
2Aug 24, 2026 17:404,74347,527,94038,213,0001,159,0002,117,632stderr
3Aug 24, 2026 17:404,75047,584,62538,310,0001,117,0002,117,632stderr
4Aug 24, 2026 17:404,78247,846,50438,630,0001,065,0002,117,632stderr
5Aug 24, 2026 17:404,89649,099,54539,572,0001,068,0002,117,632stderr
6Aug 24, 2026 17:404,90748,890,14839,615,0001,114,0002,117,632stderr
7Aug 24, 2026 17:404,98249,542,62040,301,0001,052,0002,117,632stderr
8Aug 24, 2026 17:405,00749,969,97440,519,0001,045,0002,117,632stderr
9Aug 24, 2026 17:405,14151,062,57941,614,0001,058,0002,117,632stderr