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 listSep 24, 2026 13:50wnwnError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 13:50062,682,15052,816,0001,058,0002,113,536expected "53682130159425533 ", got "18446744073709551035 53682130159425533 524124280 0 4 1226 6601566 6401674 6455913 6482492 553014 1846 1177 6419241 6393630 6468151 6488071 549979 1817 "
2Sep 24, 2026 13:50064,608,20654,124,0001,015,0002,113,536expected "53691985492951180 ", got "18446744073709551035 53691985492951180 524134028 0 4 1041 7854213 6415564 6470958 6443265 548219 2389 837 6470941 6399889 6472874 6440062 546339 2130 "
3Sep 24, 2026 13:50062,563,04252,737,0001,028,0002,113,536expected "53680389704925621 ", got "18446744073709551035 53680389704925621 524124145 0 4 1327 6580372 6433268 6444704 6427314 550569 2354 1002 6422676 6418517 6441689 6417719 545584 2068 "