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 19, 2026 06:16poilonpoilonScore: 13,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 06:1613,792123,906,339113,447,0001,029,0002,113,536
2May 19, 2026 06:1613,795124,660,549113,324,0001,178,0002,113,536
3May 19, 2026 06:1613,796125,612,876113,482,0001,031,0002,113,536
4May 19, 2026 06:1613,800125,508,765113,504,0001,041,0002,113,536
5May 19, 2026 06:1613,806126,517,174113,554,0001,040,0002,113,536
6May 19, 2026 06:1613,808124,592,824113,579,0001,034,0002,113,536
7May 19, 2026 06:1613,813124,623,242113,598,0001,050,0002,113,536
8May 19, 2026 06:1613,826125,721,558113,701,0001,060,0002,113,536
9May 19, 2026 06:1613,827126,099,253113,728,0001,037,0002,113,536