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 16:35wnwnError
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 16:3501,006,670,703996,783,0001,099,0002,113,536expected "53684820517945110 ", got "18446744073709551043 53684820517945110 524127354 0 9997 10000 10072 10055 9992 9118 10051 9997 10049 10094 28282 29458 26357 26536 26388 31207 33052 "
2Sep 24, 2026 16:3501,003,361,666988,218,0001,112,0002,113,536expected "53691755586499608 ", got "18446744073709551043 53691755586499608 524131066 0 9972 10006 10734 10037 9987 9998 9994 10027 9973 9973 28356 26423 29635 29143 26386 26446 26376 "
3Sep 24, 2026 16:3501,019,235,189996,757,00013,060,0002,113,536expected "53683941833264092 ", got "18446744073709551043 53683941833264092 524123729 0 9998 10000 10626 10074 10039 9984 10042 9997 11000 9991 31650 26311 26306 30385 30280 30291 30425 "