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 4, 2026 10:24limanjun99limanjun99Score: 4,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 10:254,68154,482,99436,588,0002,271,0002,494,464
2May 4, 2026 10:254,68855,543,23336,670,0002,246,0002,502,656
3May 4, 2026 10:254,68956,384,90736,665,0002,254,0002,502,656
4May 4, 2026 10:254,70658,881,29035,744,0003,318,0002,506,752
5May 4, 2026 10:254,71359,200,13235,875,0003,246,0002,510,848
6May 4, 2026 10:254,71956,146,58735,718,0003,457,0002,506,752
7May 4, 2026 10:254,73954,101,34135,739,0003,602,0002,490,368
8May 4, 2026 10:254,78755,791,29336,442,0003,298,0002,498,560
9May 4, 2026 10:254,82055,565,20636,647,0003,362,0002,494,464