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:58Karthik 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 07:000376,279,367365,959,0001,227,0002,113,536expected "53683760982428627 ", got "2715 27 999|2603,54 2596,46 2597,45 2601,53 2601,53 2596,45 2595,44 2601,53 2600,53 2595,45 2596,44 2601,53 |2533|176 "
2Oct 2, 2026 07:000376,192,010366,162,0001,017,0002,113,536expected "53690796730842965 ", got "2716 27 999|2602,56 2597,49 2595,48 2600,55 2600,55 2596,48 2595,48 2601,56 2600,55 2597,48 2596,47 2603,56 |2531|253 "
3Oct 2, 2026 07:000376,678,909365,413,0002,131,0002,113,536expected "53678943402258442 ", got "2721 27 999|2597,54 2608,47 2708,45 2597,54 2592,54 2588,46 2586,45 2592,53 2592,53 2588,46 2588,46 2595,54 |2527|141 "