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 16, 2026 18:41marko1597marko1597Score: 4,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 18:424,73047,659,37138,106,0001,157,0002,113,536
2Aug 16, 2026 18:424,74947,824,54538,262,0001,162,0002,113,536
3Aug 16, 2026 18:424,75647,909,85938,331,0001,151,0002,113,536
4Aug 16, 2026 18:424,77048,018,37338,424,0001,175,0002,113,536
5Aug 16, 2026 18:424,78048,059,56338,660,0001,017,0002,113,536
6Aug 16, 2026 18:424,78748,121,68038,577,0001,157,0002,113,536
7Aug 16, 2026 18:424,79948,282,65838,674,0001,162,0002,113,536
8Aug 16, 2026 18:424,80356,333,74638,853,0001,017,0002,113,536
9Aug 16, 2026 18:424,81648,404,66038,814,0001,159,0002,113,536