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 listSep 6, 2026 09:18Kevin HeaveyKevin HeaveyScore: 3,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:193,50939,582,51828,083,0001,046,0002,113,536
2Sep 6, 2026 09:193,52937,635,61828,073,0001,225,0002,113,536
3Sep 6, 2026 09:193,55137,876,10128,436,0001,038,0002,113,536
4Sep 6, 2026 09:193,55239,880,59128,411,0001,078,0002,113,536
5Sep 6, 2026 09:193,56538,089,97728,553,0001,039,0002,113,536
6Sep 6, 2026 09:193,72239,837,49729,856,0001,038,0002,113,536
7Sep 6, 2026 09:193,77341,363,20930,268,0001,052,0002,113,536
8Sep 6, 2026 09:193,78142,084,78530,274,0001,109,0002,113,536
9Sep 6, 2026 09:193,83642,984,76530,647,0001,197,0002,113,536