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 listJul 13, 2026 23:29boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 23:290473,525,983461,198,0002,052,0002,113,536expected "53692918463864817 ", got "53692906841434609 "
2Jul 13, 2026 23:290475,071,067462,740,0002,010,0002,113,536expected "53681809770698529 ", got "53681803703379233 "
3Jul 13, 2026 23:290474,844,982462,389,0002,060,0002,113,536expected "53687543624688351 ", got "53687532027797215 "