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 06:40C#_userC#_userScore: 60,223Success
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 06:4159,761504,693,612495,015,0001,004,0002,117,632
2Sep 11, 2026 06:4159,915505,986,064496,291,0001,004,0002,117,632
3Sep 11, 2026 06:4159,922506,006,089496,351,0001,003,0002,117,632
4Sep 11, 2026 06:4160,123507,715,602498,019,0001,005,0002,117,632
5Sep 11, 2026 06:4160,223508,548,358495,945,0003,906,0002,117,632
6Sep 11, 2026 06:4160,241508,827,051499,003,0001,005,0002,117,632
7Sep 11, 2026 06:4160,381510,114,692496,204,0004,964,0002,117,632
8Sep 11, 2026 06:4160,600511,689,284501,985,0001,003,0002,117,632
9Sep 11, 2026 06:4160,612512,295,554498,922,0004,162,0002,117,632