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:32Karthik 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:360376,546,318366,482,0001,010,0002,113,536expected "53691663019874046 ", got "2720 28 999|2602,58 2600,58 2601,58 2607,69 2611,72 2602,58 2601,58 2600,57 2599,57 2606,68 2613,71 2600,57 |2531|200 "
2Oct 2, 2026 06:360376,661,276366,529,0001,075,0002,113,536expected "53683100158096578 ", got "2712 26 999|2602,57 2599,57 2600,56 2607,68 2627,71 2600,56 2598,56 2600,56 2600,56 2610,68 2610,71 2614,56 |2527|146 "
3Oct 2, 2026 06:360376,485,685366,281,0001,190,0002,113,536expected "53685994021259605 ", got "2718 26 999|2600,55 2600,53 2609,54 2607,65 2610,68 2599,54 2597,54 2599,53 2599,54 2609,65 2608,68 2599,53 |2533|254 "