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 listDec 8, 2025 11:39luckyhwanluckyhwanScore: 53,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:3953,710471,356,653444,793,000999,0002,510,848
2Dec 8, 2025 11:3953,717472,236,660443,853,0001,999,0002,383,872
3Dec 8, 2025 11:3953,728470,411,324443,946,0001,999,0002,387,968
4Dec 8, 2025 11:3953,730472,138,733443,964,0001,999,0002,519,040
5Dec 8, 2025 11:3953,737472,309,883445,020,0001,000,0002,519,040
6Dec 8, 2025 11:3953,755476,091,618445,165,0001,000,0002,387,968
7Dec 8, 2025 11:3953,776468,287,337446,339,00002,519,040
8Dec 8, 2025 11:3953,783472,938,922445,400,0001,000,0002,510,848
9Dec 8, 2025 11:3953,790478,246,216446,455,00002,519,040