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 listSep 16, 2025 18:52Aleksei ShahoikaAleksei ShahoikaScore: 25,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2025 18:5225,402234,236,789209,835,000999,0002,277,376
2Sep 16, 2025 18:5225,425234,015,298210,030,0001,000,0002,260,992
3Sep 16, 2025 18:5225,458232,642,079210,303,0001,001,0002,265,088
4Sep 16, 2025 18:5225,460236,053,146210,318,0001,001,0002,519,040
5Sep 16, 2025 18:5225,472233,601,854210,419,0001,001,0002,519,040
6Sep 16, 2025 18:5225,481240,920,940210,488,0001,002,0002,285,568
7Sep 16, 2025 18:5225,508243,895,800209,716,0001,997,0002,265,088
8Sep 16, 2025 18:5225,511243,592,643210,744,000998,0002,285,568
9Sep 16, 2025 18:5225,558237,494,069211,132,0001,000,0002,277,376