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 17:37marko1597marko1597Score: 143,133Success
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 17:38141,9861,188,619,4601,177,347,0001,144,0002,117,632stderr
2Aug 14, 2026 17:38142,3141,191,302,0231,180,211,0001,001,0002,117,632stderr
3Aug 14, 2026 17:38143,0761,197,715,9241,186,530,0001,003,0002,117,632stderr
4Aug 14, 2026 17:38143,0821,197,637,4991,186,416,0001,165,0002,117,632stderr
5Aug 14, 2026 17:38143,1331,198,149,7451,186,889,0001,115,0002,117,632stderr
6Aug 14, 2026 17:38143,1451,198,146,7211,186,945,0001,159,0002,117,632stderr
7Aug 14, 2026 17:38143,2311,198,986,9041,187,821,0001,003,0002,117,632stderr
8Aug 14, 2026 17:38143,3901,200,148,3331,188,983,0001,155,0002,117,632stderr
9Aug 14, 2026 17:38143,6671,203,717,7381,191,439,0001,000,0002,117,632stderr