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 10, 2026 08:34Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:34046,060,13632,709,0001,099,0002,482,176expected "53680907085810352 ", got "53680904874617632 "
2May 10, 2026 08:344,09052,092,05632,800,0001,151,0002,482,176
3May 10, 2026 08:344,10150,969,73632,912,0001,130,0002,482,176
4May 10, 2026 08:344,10751,633,08933,031,0001,065,0002,486,272
5May 10, 2026 08:344,10847,650,06733,005,0001,094,0002,473,984
6May 10, 2026 08:344,10948,498,99532,963,0001,147,0002,486,272
7May 10, 2026 08:344,10947,365,52532,947,0001,160,0002,482,176
8May 10, 2026 08:344,11648,837,35933,104,0001,066,0002,486,272
9May 10, 2026 08:344,12150,019,53533,097,0001,113,0002,490,368