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 9, 2026 14:32wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:33044,739,73627,104,0001,112,0002,482,176expected "53687654341593122 ", got "53687654341263122 "
2May 9, 2026 14:333,39041,599,88227,054,0001,089,0002,486,272
3May 9, 2026 14:333,40440,572,44127,207,0001,052,0002,482,176
4May 9, 2026 14:333,41444,810,84027,201,0001,138,0002,478,080
5May 9, 2026 14:333,48948,158,41227,882,0001,079,0002,478,080
6May 9, 2026 14:333,53245,823,91228,236,0001,081,0002,486,272
7May 9, 2026 14:333,54346,242,10928,341,0001,073,0002,482,176
8May 9, 2026 14:333,56545,054,30128,489,0001,101,0002,486,272
9May 9, 2026 14:333,56846,821,75028,539,0001,077,0002,498,560