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 listMay 1, 2026 09:08limanjun99limanjun99Score: 15,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 09:0915,281146,582,930124,841,0001,997,0002,506,752stderr
2May 1, 2026 09:0915,282145,380,070123,851,0002,996,0002,519,040stderr
3May 1, 2026 09:0915,291145,300,322123,920,0002,998,0002,502,656stderr
4May 1, 2026 09:0915,299148,461,082123,983,0002,999,0002,342,912stderr
5May 1, 2026 09:0915,306149,724,213124,043,0003,001,0002,490,368stderr
6May 1, 2026 09:0915,418143,308,938125,961,0002,015,0002,342,912stderr
7May 1, 2026 09:0915,418142,784,975124,976,0002,999,0002,326,528stderr
8May 1, 2026 09:0915,441148,815,771125,161,0003,003,0002,342,912stderr
9May 1, 2026 09:0915,445149,324,593125,196,0003,004,0002,498,560stderr