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 02:28Victor 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 02:29037,057,34127,393,0001,078,0002,113,536expected "53681887862862853 ", got "0 "
2Sep 2, 2026 02:29036,755,72127,297,0001,075,0002,113,536expected "53682089373798403 ", got "0 "
3Sep 2, 2026 02:29036,823,44327,361,0001,082,0002,113,536expected "53689525964954580 ", got "0 "