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:32Karthik 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:3201,375,075,4741,320,402,00045,511,0002,113,536expected "53686463824048436 ", got "2637 2568 2598 2569 2597 2569 2598 2568 "
2Oct 2, 2026 11:3201,375,801,9241,320,807,00045,876,0002,113,536expected "53690369926213018 ", got "2641 2573 2599 2570 2599 2570 2599 2572 "
3Oct 2, 2026 11:3201,374,049,6891,319,591,00045,325,0002,113,536expected "53683993442488397 ", got "2634 2565 2591 2564 2592 2565 2594 2565 "