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 11, 2025 02:47Leon ZhaoLeon ZhaoScore: 11,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 02:4711,365122,772,17592,323,0002,007,0002,465,792
2Aug 11, 2025 02:4711,367122,653,96193,344,0001,003,0002,461,696
3Aug 11, 2025 02:4711,372117,961,05494,390,00002,285,568
4Aug 11, 2025 02:4711,675123,726,70095,901,000998,0002,301,952
5Aug 11, 2025 02:4711,681125,584,75194,951,0001,998,0002,285,568
6Aug 11, 2025 02:4711,686120,825,82095,998,000999,0002,285,568