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 listOct 1, 2026 17:14Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 17:14089,265,52479,142,0001,088,00020,480expected "53688240124882369 ", got "53688240124882369 2 2 417 26370 56 1 140 |26211 26206 |79264 "
2Oct 1, 2026 17:14089,257,21379,200,0001,002,00020,480expected "53685599532382689 ", got "53685599532382689 2 2 414 26496 58 1 137 |26214 26194 |79380 "
3Oct 1, 2026 17:14089,976,32179,861,0001,007,00020,480expected "53686543072747763 ", got "53686543072747763 2 2 413 27203 53 1 148 |26193 26169 |80036 "