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 06:26Karthik 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 06:260323,736,030313,586,0001,108,0002,113,536expected "53684873750164862 ", got "2704 27 999|2597,52 2598,52 2607,52 2607,52 2596,52 2596,52 2598,52 2596,51 2597,52 2596,51 |2531|133 "
2Oct 2, 2026 06:260325,692,560315,553,0001,075,0002,113,536expected "53688314266502868 ", got "2723 26 999|2612,53 2614,53 2619,54 2620,54 2626,54 2614,54 2615,53 2614,53 2613,53 2613,53 |2535|130 "
3Oct 2, 2026 06:260324,978,024314,635,0001,135,0002,113,536expected "53687577791891621 ", got "2720 26 999|2619,53 2603,52 2614,54 2614,53 2609,53 2605,54 2601,52 2602,52 2604,52 2606,53 |2531|174 "