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 listFeb 1, 2025 21:42E SequeiraE SequeiraScore: 94,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2025 11:0394,879815,872,465726,533,00060,960,0002,367,488
2Feb 5, 2025 11:0394,880809,568,293721,548,00065,958,0002,326,528
3Feb 1, 2025 21:4294,909815,714,389731,765,00055,982,0002,322,432
4Feb 5, 2025 11:0394,970819,854,766741,233,00047,014,0002,367,488
5Feb 1, 2025 21:4294,995813,940,990725,502,00062,956,0002,359,296
6Feb 1, 2025 21:4295,065813,657,504726,034,00063,003,0002,363,392