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 listOct 27, 2025 04:13Tan Lip WeiTan Lip WeiScore: 42,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 04:1342,506377,200,683350,801,0001,998,0002,269,184
2Oct 27, 2025 04:1342,524376,079,033350,949,0001,999,0002,383,872
3Oct 27, 2025 04:1342,620377,350,270351,752,0001,998,0002,285,568
4Oct 27, 2025 04:1342,631377,837,011351,835,0001,999,0002,265,088
5Oct 27, 2025 04:1342,640383,163,088351,910,0001,999,0002,285,568
6Oct 27, 2025 04:1342,827385,158,249354,464,0001,001,0002,285,568
7Oct 27, 2025 04:1342,857383,029,341353,711,0001,998,0002,285,568
8Oct 27, 2025 04:1342,857381,623,208353,714,0001,998,0002,285,568
9Oct 27, 2025 04:1342,858378,821,442354,725,000999,0002,269,184