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 25, 2026 16:38Kenzie_RTKenzie_RTScore: 82,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:3880,976683,078,833671,043,0001,060,0002,113,536
2May 25, 2026 16:3881,375684,695,593674,335,0001,082,0002,113,536
3May 25, 2026 16:3881,746687,796,707677,370,0001,122,0002,113,536
4May 25, 2026 16:3881,908689,233,235678,747,0001,093,0002,113,536
5May 25, 2026 16:3882,303695,121,794682,012,0001,104,0002,113,536
6May 25, 2026 16:3882,304692,470,741682,060,0001,065,0002,113,536
7May 25, 2026 16:3882,311692,700,296682,185,0001,002,0002,113,536
8May 25, 2026 16:3882,313694,438,158682,066,0001,138,0002,113,536
9May 25, 2026 16:3882,364695,972,198682,617,0001,007,0002,113,536