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 16:56wnwnError
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 16:560584,937,982574,422,0001,114,0002,117,632expected "53686346652337095 ", got "18446744073709551044 53686346652337095 524129219 0 9759 10012 10238 10075 9942 10092 28506 26274 26260 29639 26488 "
2Sep 24, 2026 16:560603,311,975592,641,0001,046,0002,113,536expected "53685113124793285 ", got "18446744073709551044 53685113124793285 524129629 0 9999 9971 10128 10253 10108 10103 26316 30351 29468 29731 26605 "
3Sep 24, 2026 16:560651,516,166628,712,00013,057,0002,113,536expected "53684078523447322 ", got "18446744073709551044 53684078523447322 524130015 0 10007 9986 10119 10094 11294 10039 27437 34187 30266 30591 33864 "