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 listAug 30, 2026 20:44Josu San MartinJosu San MartinScore: 4,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:494,60946,680,18837,224,0001,034,0002,113,536
2Aug 30, 2026 20:494,61246,747,29637,243,0001,041,0002,113,536
3Aug 30, 2026 20:494,61646,682,30537,283,0001,036,0002,113,536
4Aug 30, 2026 20:494,61946,802,76137,224,0001,116,0002,113,536
5Aug 30, 2026 20:494,62046,825,33337,302,0001,045,0002,113,536
6Aug 30, 2026 20:494,62446,778,07237,340,0001,042,0002,113,536
7Aug 30, 2026 20:494,63346,847,75637,419,0001,042,0002,113,536
8Aug 30, 2026 20:494,63347,568,48137,348,0001,114,0002,113,536
9Aug 30, 2026 20:494,75147,794,33238,331,0001,103,0002,113,536