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 11:30Karthik 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 11:3101,415,230,5391,360,638,00045,389,0002,113,536expected "53687981385680909 ", got "2627 2716 2585 2716 2586 2730 2585 2716 "
2Oct 2, 2026 11:3101,416,449,0441,361,431,00045,887,0002,113,536expected "53690765196134719 ", got "2637 2726 2597 2727 2596 2726 2596 2727 "
3Oct 2, 2026 11:3101,416,026,2381,361,287,00045,498,0002,113,536expected "53687646548104668 ", got "2633 2724 2591 2722 2591 2722 2592 2723 "