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 listJan 31, 2025 16:27AdityaAdityaScore: 66,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2025 16:2966,501576,491,562549,957,0001,999,0002,519,040
2Jan 31, 2025 16:2966,519580,924,125551,106,0001,000,0002,519,040
3Jan 31, 2025 16:2966,521584,510,744551,127,0001,000,0002,519,040
4Jan 31, 2025 16:2966,521574,073,416552,121,00002,396,160
5Jan 31, 2025 16:2966,522575,392,973551,131,0001,000,0002,519,040
6Jan 31, 2025 16:2766,536581,557,042551,249,0001,000,0002,519,040
7Jan 31, 2025 16:2766,542573,732,344550,297,0002,001,0002,383,872
8Jan 31, 2025 16:2766,546575,447,511551,328,0001,000,0002,392,064
9Jan 31, 2025 16:2966,577578,867,901550,594,0001,998,0002,523,136