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 3, 2026 17:15Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:16046,989,05437,502,0001,037,0002,117,632expected "53688927221420709 ", got "151048436599728379 "stderr
2Sep 3, 2026 17:16047,954,69438,532,0001,035,0002,117,632expected "53681066716589567 ", got "150697893502860643 "stderr
3Sep 3, 2026 17:16052,568,72238,894,0001,155,0002,117,632expected "53688577826178795 ", got "150977691565200372 "stderr