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 28, 2026 06:46C#_userC#_userScore: 62,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 06:4962,547528,891,621460,340,00058,801,0002,142,208
2Aug 28, 2026 06:4962,548528,800,747460,044,00059,112,0002,142,208
3Aug 28, 2026 06:4962,589529,229,865460,296,00059,194,0002,142,208
4Aug 28, 2026 06:4962,590529,186,711460,404,00059,096,0002,142,208
5Aug 28, 2026 06:4962,596529,235,476460,365,00059,182,0002,142,208
6Aug 28, 2026 06:4962,615529,452,344460,520,00059,190,0002,142,208
7Aug 28, 2026 06:4962,618529,458,513460,417,00059,319,0002,142,208
8Aug 28, 2026 06:4962,627529,595,788460,308,00059,497,0002,142,208
9Aug 28, 2026 06:4962,649529,652,398460,928,00059,059,0002,142,208