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 24, 2026 15:17wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:180746,924,379736,964,0001,058,0002,113,536expected "53689071568107077 ", got "18446744073709551039 53689071568107077 524130497 0 9996 9976 9997 9997 10008 10034 10020 10007 26298 26320 26306 26295 26357 26327 "
2Sep 24, 2026 15:180746,698,668736,176,0001,032,0002,113,536expected "53685043721590756 ", got "18446744073709551039 53685043721590756 524130867 0 10008 10002 10003 9999 10006 10008 9970 9998 26254 26225 26243 26235 26245 26231 "
3Sep 24, 2026 15:180743,545,344733,760,0001,003,0002,113,536expected "53692755977666528 ", got "18446744073709551039 53692755977666528 524134366 0 9996 9930 10007 10009 10007 10007 10006 10002 26153 26232 26225 26184 26166 26152 "