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 14:33PolycarbohydratePolycarbohydrateScore: 388,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 14:33387,2653,244,193,9293,155,333,00058,968,0002,371,584
2Feb 1, 2025 14:33387,5163,245,880,3593,145,419,00070,964,0002,281,472
3Feb 1, 2025 14:33387,6653,250,107,1273,157,668,00059,955,0002,375,680
4Feb 1, 2025 14:33388,4563,252,945,7773,161,224,00062,964,0002,281,472
5Feb 1, 2025 14:33388,6023,250,896,5933,156,429,00068,965,0002,281,472
6Feb 1, 2025 14:33390,0253,259,625,1373,162,248,00074,958,0002,359,296
7Feb 1, 2025 14:33390,1473,267,945,0383,174,258,00063,964,0002,289,664
8Feb 1, 2025 14:33391,0543,270,799,5693,169,803,00075,947,0002,281,472
9Feb 1, 2025 14:33391,2933,272,742,9013,181,756,00065,974,0002,289,664