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:49C#_userC#_userScore: 43,754Success
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:4943,745371,733,513362,081,0001,003,0002,117,632
2Sep 11, 2026 07:4943,747373,009,867362,101,0001,004,0002,117,632
3Sep 11, 2026 07:4943,752371,880,497362,140,0001,006,0002,117,632
4Sep 11, 2026 07:4943,754373,044,671362,156,0001,004,0002,117,632
5Sep 11, 2026 07:4943,754371,638,599362,160,0001,005,0002,117,632
6Sep 11, 2026 07:4943,755371,824,709362,166,0001,003,0002,117,632
7Sep 11, 2026 07:4943,758371,837,416362,193,0001,003,0002,117,632
8Sep 11, 2026 07:4943,765371,882,688362,254,0001,003,0002,117,632
9Sep 11, 2026 07:4943,767372,033,566362,268,0001,004,0002,117,632