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 08:01C#_userC#_userScore: 45,129Success
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 08:0145,109383,075,155373,401,0001,004,0002,117,632
2Sep 11, 2026 08:0145,115383,186,789373,459,0001,003,0002,117,632
3Sep 11, 2026 08:0145,126383,049,462373,544,0001,006,0002,117,632
4Sep 11, 2026 08:0145,128383,320,103373,563,0001,005,0002,117,632
5Sep 11, 2026 08:0145,129383,265,819373,568,0001,004,0002,117,632
6Sep 11, 2026 08:0145,130384,361,777373,577,0001,004,0002,117,632
7Sep 11, 2026 08:0145,132384,063,829373,592,0001,004,0002,117,632
8Sep 11, 2026 08:0145,132383,238,302373,594,0001,004,0002,117,632
9Sep 11, 2026 08:0145,132383,322,173373,595,0001,005,0002,117,632