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 07:53wnwnError
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 07:5401,274,430,6681,264,447,0001,198,0002,113,536expected "53679823852124037 ", got "18446744073709551002 53679823852124037 524122434 0 9775 10001 9986 10172 9986 10006 9901 10030 10068 10003 10003 9905 10131 10028 9997 10090 26381 26290 "
2Sep 24, 2026 07:5401,265,477,5321,255,484,0001,133,0002,113,536expected "53688906965989697 ", got "18446744073709551002 53688906965989697 524131730 0 10010 9995 9985 10167 9973 10048 10005 10043 10034 10003 10042 10001 10163 9982 10003 10055 26134 26115 "
3Sep 24, 2026 07:5401,273,055,6051,263,137,0001,132,0002,113,536expected "53683341029240480 ", got "18446744073709551002 53683341029240480 524129626 0 9753 10001 10038 10242 10038 10049 10011 10010 9979 10049 10081 10006 10175 9998 10006 10066 26345 26229 "