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 14, 2026 13:45marko1597marko1597Score: 6,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:466,45163,538,29352,415,0001,132,0002,113,536
2Aug 14, 2026 13:466,45363,624,10752,399,0001,166,0002,113,536
3Aug 14, 2026 13:466,46263,658,84352,404,0001,233,0002,113,536
4Aug 14, 2026 13:466,46564,520,16952,433,0001,231,0002,113,536
5Aug 14, 2026 13:466,46664,488,01752,409,0001,262,0002,113,536
6Aug 14, 2026 13:466,46864,492,96352,455,0001,237,0002,113,536
7Aug 14, 2026 13:466,47364,457,58952,488,0001,241,0002,113,536
8Aug 14, 2026 13:466,60564,860,51153,586,0001,236,0002,113,536
9Aug 14, 2026 13:466,65065,954,88554,044,0001,156,0002,113,536