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 14:36kpkpScore: 89,021Success
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 14:3688,997749,989,637679,790,00058,891,0002,113,536
2May 25, 2026 14:3689,021748,363,101680,052,00058,824,0002,113,536
3May 25, 2026 14:3689,033748,319,732679,861,00059,118,0002,113,536