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 21, 2025 20:34Aniruddha DebAniruddha DebError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:27M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:160312,959,093247,144,00057,264,0002,117,632expected "11318049299365247 ", got "101595249210684209 "
2May 17, 2026 15:160318,845,104249,823,00060,440,0002,125,824expected "11318049299365247 ", got "101595249210684209 "
3May 17, 2026 15:160320,296,068248,916,00061,146,0002,117,632expected "11318049299365247 ", got "101595249210684209 "
4Jul 21, 2025 20:345,85871,888,37443,559,0005,065,0002,387,968
5Jul 21, 2025 20:345,88772,852,89042,878,0005,983,0002,400,256
6Jul 21, 2025 20:345,95171,418,23141,329,0008,064,0002,338,816