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 listSep 11, 2026 07:16C#_userC#_userScore: 43,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 07:1643,930374,482,472363,616,0001,004,0002,117,632
2Sep 11, 2026 07:1643,937373,446,034363,681,0001,003,0002,117,632
3Sep 11, 2026 07:1643,948373,548,372363,767,0001,005,0002,117,632
4Sep 11, 2026 07:1643,948373,451,583363,766,0001,005,0002,117,632
5Sep 11, 2026 07:1643,950374,052,735363,784,0001,003,0002,117,632
6Sep 11, 2026 07:1643,956373,636,190363,835,0001,006,0002,117,632
7Sep 11, 2026 07:1643,966373,780,908362,884,0002,037,0002,117,632
8Sep 11, 2026 07:1643,974373,701,647363,984,0001,005,0002,117,632
9Sep 11, 2026 07:1644,260376,996,060364,342,0003,021,0002,117,632