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 18, 2025 05:15Ashish AhujaAshish AhujaScore: 12,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 05:1512,151128,536,22490,870,0009,985,0002,416,640
2Aug 18, 2025 05:1512,306125,132,29995,133,0007,009,0002,330,624
3Aug 18, 2025 05:1512,350133,333,95990,567,00011,942,0002,465,792
4Aug 18, 2025 05:1512,365130,336,09292,663,0009,963,0002,375,680
5Aug 18, 2025 05:1512,393131,625,43994,874,0007,989,0002,334,720
6Aug 18, 2025 05:1512,477126,453,36695,591,0007,965,0002,383,872
7Aug 18, 2025 05:1512,511132,899,34895,851,0007,987,0002,506,752
8Aug 18, 2025 05:1512,529131,167,60995,991,0007,999,0002,506,752
9Aug 18, 2025 05:1512,709129,732,25196,532,0008,956,0002,330,624