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 26, 2025 09:01Ashish AhujaAshish AhujaScore: 11,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 09:0111,561131,682,52076,966,00018,991,0002,498,560
2Aug 26, 2025 09:0111,585122,300,10174,347,00021,808,0002,490,368
3Aug 26, 2025 09:0111,643126,303,71875,715,00020,921,0002,461,696
4Aug 26, 2025 09:0111,653121,529,63877,776,00018,945,0002,490,368
5Aug 26, 2025 09:0111,742125,738,04881,549,00015,912,0002,498,560
6Aug 26, 2025 09:0111,894122,294,78480,769,00017,948,0002,498,560