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 14:05wnwnError
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 14:060754,432,949743,803,0001,037,0002,113,536expected "53691627344852901 ", got "18446744073709551037 53691627344852901 524131851 0 10008 10001 10001 10006 9979 9982 9989 10005 26500 26499 26510 26516 26441 26499 "
2Sep 24, 2026 14:060745,449,187735,500,0001,038,0002,113,536expected "53688712587975734 ", got "18446744073709551037 53688712587975734 524132272 0 9997 10002 10022 10033 10014 10014 9997 10002 26200 26194 26197 26267 26243 26192 "
3Sep 24, 2026 14:060749,999,531739,495,0001,013,0002,113,536expected "53684362841173495 ", got "18446744073709551037 53684362841173495 524129086 0 10001 9981 9997 10024 10001 9882 9995 9999 26339 26398 26309 26397 26303 26310 "