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 4, 2026 23:03Aleksei ShahoikaAleksei ShahoikaScore: 15,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:0415,380144,276,118105,772,00021,887,0002,416,640
2May 4, 2026 23:0415,474145,709,690106,577,00021,864,0002,412,544
3May 4, 2026 23:0415,485143,853,499106,680,00021,849,0002,404,352
4May 4, 2026 23:0415,507147,942,206105,972,00022,744,0002,404,352
5May 4, 2026 23:0415,511147,267,758106,613,00022,132,0002,412,544
6May 4, 2026 23:0415,530144,820,124106,917,00021,990,0002,392,064
7May 4, 2026 23:0415,583148,506,152106,775,00022,572,0002,416,640
8May 4, 2026 23:0415,659148,980,289106,958,00023,019,0002,412,544
9May 4, 2026 23:0415,668149,134,588106,903,00023,142,0002,412,544