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 listOct 2, 2026 18:29Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:29034,363,20425,658,000020,480expected "53687808323423171 ", got "M2 pop0 iv1 v0 gaps0 0us x1 "
2Oct 2, 2026 18:29034,442,64425,664,000020,480expected "53687595886796281 ", got "M2 pop0 iv1 v0 gaps1 13us x0 "
3Oct 2, 2026 18:29034,412,55225,695,000020,480expected "53690739637069696 ", got "M2 pop0 iv0 v0 gaps0 0us x0 "