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: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 15:300242,373,790232,193,0001,084,0002,113,536expected "53689106021014134 ", got "2583 2566 2585 2562 2566 2585 2562 2568 2585 "
2Oct 2, 2026 15:300243,474,262233,240,0001,150,0002,113,536expected "53691356478664235 ", got "2593 2577 2611 2572 2576 2598 2573 2578 2597 "
3Oct 2, 2026 15:300244,201,978234,178,0001,100,0002,113,536expected "53681635174368501 ", got "2602 2588 2610 2582 2589 2610 2581 2587 2610 "