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 5, 2025 08:40rogue *rogue *Score: 37,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2025 08:4037,758338,641,681311,393,0002,002,0002,387,968
2Oct 5, 2025 08:4037,773340,002,001311,514,0002,003,0002,510,848
3Oct 5, 2025 08:4037,779342,051,232312,569,000998,0002,519,040
4Oct 5, 2025 08:4037,780338,099,173313,570,00002,256,896
5Oct 5, 2025 08:4037,785342,917,560313,613,00002,387,968
6Oct 5, 2025 08:4037,793344,666,163311,688,0001,998,0002,379,776
7Oct 5, 2025 08:4037,795342,585,792310,698,0002,997,0002,387,968
8Oct 5, 2025 08:4037,799338,188,589312,733,000999,0002,387,968
9Oct 5, 2025 08:4037,803342,546,124311,765,0001,998,0002,379,776