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 8, 2025 13:12Ashish AhujaAshish AhujaScore: 70,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 13:1270,071608,382,100580,587,0001,001,0002,523,136
2Aug 8, 2025 13:1270,088603,579,296579,732,0001,999,0002,285,568
3Aug 8, 2025 13:1270,088604,321,758578,732,0002,998,0002,285,568
4Aug 8, 2025 13:1270,088603,929,728580,734,000999,0002,269,184
5Aug 8, 2025 13:1270,101603,570,095579,842,0001,999,0002,285,568
6Aug 8, 2025 13:1270,106607,611,767579,884,0001,999,0002,269,184
7Aug 8, 2025 13:1270,111606,106,761579,923,0001,999,0002,285,568
8Aug 8, 2025 13:1270,115610,193,504579,956,0001,999,0002,285,568
9Aug 8, 2025 13:1270,118606,051,836580,977,000999,0002,285,568