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 2, 2026 11:16Victor 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 2, 2026 11:18037,271,63827,041,0001,070,0002,117,632expected "53681480972680993 ", got "0 "stderr
2Sep 2, 2026 11:18036,453,28126,973,0001,104,0002,117,632expected "53689653275165110 ", got "0 "stderr
3Sep 2, 2026 11:18036,974,16126,836,0001,101,0002,117,632expected "53686508007319714 ", got "0 "stderr