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 21, 2025 21:54Gerard SmitGerard SmitScore: 75,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 21:5475,032645,890,263621,764,000999,0002,310,144
2Jan 21, 2025 21:5475,034653,207,655620,787,0001,999,0002,314,240
3Jan 21, 2025 21:5475,034650,469,245619,787,0002,998,0002,392,064
4Jan 21, 2025 21:5475,047649,645,510620,891,0001,999,0002,383,872
5Jan 21, 2025 21:5475,076646,788,292621,134,0002,000,0002,314,240
6Jan 21, 2025 21:5475,080652,265,796621,168,0002,000,0002,383,872
7Jan 21, 2025 21:5475,110649,506,684622,411,0001,000,0002,297,856
8Jan 21, 2025 21:5475,127655,337,858620,555,0002,997,0002,383,872
9Jan 21, 2025 21:5475,159656,818,714621,820,0001,999,0002,297,856