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 listNov 20, 2024 01:32zielajzielajScore: 3,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 01:323,52251,225,04827,215,0002,015,0002,379,776
2Nov 20, 2024 01:323,52853,415,99327,264,0002,019,0002,514,944
3Nov 20, 2024 01:323,53949,547,61428,363,0001,012,0002,527,232
4Nov 20, 2024 01:323,73561,823,41429,003,0002,000,0002,404,352
5Nov 20, 2024 01:323,74152,578,80029,050,0002,003,0002,396,160
6Nov 20, 2024 01:323,74355,378,45729,062,0002,004,0002,396,160