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: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 11:290312,635,036255,848,00046,013,0002,113,536expected "53683176888985527 ", got "2614 2585 2587 2593 2627 2596 2592 2592 "
2Oct 2, 2026 11:290312,060,723256,566,00046,387,0002,113,536expected "53684238312185525 ", got "2624 2596 2594 2595 2593 2594 2594 2595 "
3Oct 2, 2026 11:290311,122,888255,896,00045,919,0002,113,536expected "53686592385810439 ", got "2620 2590 2591 2589 2590 2591 2590 2591 "