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 17, 2025 09:17Ashish AhujaAshish AhujaScore: 14,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 09:1713,761142,635,160103,197,00011,021,0002,351,104
2Aug 17, 2025 09:1714,033142,068,285101,540,00014,932,0002,367,488
3Aug 17, 2025 09:1714,038142,592,951101,578,00014,938,0002,359,296
4Aug 17, 2025 09:1714,053143,429,171103,683,00012,960,0002,355,200
5Aug 17, 2025 09:1714,123144,121,649105,199,00012,022,0002,441,216
6Aug 17, 2025 09:1714,156143,379,251106,539,00010,952,0002,371,584
7Aug 17, 2025 09:1714,201150,149,213104,883,00012,985,0002,347,008
8Aug 17, 2025 09:1714,683143,931,756110,883,00010,988,0002,367,488
9Aug 17, 2025 09:1714,699145,575,784108,003,00014,000,0002,359,296