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 1, 2026 17:35Karthik 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 1, 2026 17:350274,623,184264,364,0001,169,0002,113,536expected "53684339817370784 ", got "2727 27 999|2630,43,2021 2636,57,3307 2620,55,3080 2641,35,1142 2630,43,2021 2637,56,3307 2617,54,3080 2649,36,1142 |2535|76 "
2Oct 1, 2026 17:350273,630,090263,432,0001,121,0002,113,536expected "53688740429378970 ", got "2710 27 999|2623,39,1905 2626,53,3213 2607,51,2986 2635,32,1037 2622,39,1905 2627,53,3213 2609,52,2986 2635,32,1037 |2528|165 "
3Oct 1, 2026 17:350275,043,653264,510,0001,117,0002,113,536expected "53687877538770935 ", got "2732 26 999|2673,42,1907 2630,53,3209 2612,51,2985 2636,33,1033 2625,40,1907 2632,53,3209 2616,51,2985 2640,33,1033 |2532|102 "