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 15:35Karthik 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 15:350242,614,132232,399,0001,126,0002,113,536expected "53689797616194916 ", got "2632 2570 2569 2569 2572 2569 2567 2572 2570 "
2Oct 2, 2026 15:350241,762,700231,658,0001,091,0002,113,536expected "53690777069335756 ", got "2586 2566 2564 2565 2565 2564 2564 2568 2564 "
3Oct 2, 2026 15:350243,262,162233,062,0001,089,0002,113,536expected "53685662823017867 ", got "2599 2582 2583 2580 2582 2580 2578 2582 2582 "