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 07:19Karthik 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:220342,979,298332,945,0001,006,0002,113,536expected "53680206495965797 ", got "2705 27 999|2601,55 2600,54 2714,57 2715,57 2966,58 2964,58 3073,54 3082,54 2600,54 2600,54 |2526|43 "
2Oct 2, 2026 07:220343,543,612333,313,0001,131,0002,113,536expected "53690115707996622 ", got "2717 27 999|2600,54 2600,53 2719,54 2717,54 2973,57 2977,57 3078,52 3077,52 2601,53 2602,53 |2533|207 "
3Oct 2, 2026 07:220343,422,351333,321,0001,039,0002,113,536expected "53686439685547141 ", got "2713 28 999|2601,52 2600,53 2714,56 2712,56 2975,57 2976,56 3072,52 3089,50 2600,52 2600,52 |2533|170 "