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: 33,796Success
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:1333,785309,192,801279,415,0001,001,0002,285,568
2Oct 27, 2025 04:1333,789308,911,838279,451,0001,001,0002,347,008
3Oct 27, 2025 04:1333,790310,792,433279,459,0001,001,0002,285,568
4Oct 27, 2025 04:1333,796307,173,319279,504,0001,001,0002,285,568
5Oct 27, 2025 04:1333,796306,636,603279,509,0001,001,0002,265,088
6Oct 27, 2025 04:1333,805303,218,898278,585,0001,997,0002,519,040
7Oct 27, 2025 04:1333,811308,781,464279,636,000998,0002,289,664
8Oct 27, 2025 04:1333,813303,957,990279,654,000998,0002,383,872
9Oct 27, 2025 04:1333,816310,663,782278,676,0001,997,0002,285,568