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 listMay 7, 2026 10:07wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:07042,859,54027,136,0001,059,0002,482,176expected "53684066102672265 ", got "53684066102659935 "
2May 7, 2026 10:073,37645,506,46526,964,0001,057,0002,478,080
3May 7, 2026 10:073,39641,968,72227,126,0001,064,0002,486,272
4May 7, 2026 10:073,39642,503,22527,130,0001,062,0002,482,176
5May 7, 2026 10:073,40646,525,11927,193,0001,083,0002,486,272
6May 7, 2026 10:073,41444,531,90227,253,0001,087,0002,482,176
7May 7, 2026 10:073,45644,105,41327,599,0001,086,0002,490,368
8May 7, 2026 10:073,60848,058,00728,802,0001,149,0002,482,176
9May 7, 2026 10:073,61946,271,70228,943,0001,095,0002,486,272