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 5, 2024 09:54kauruuskauruusScore: 59,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 09:5459,345517,626,622489,557,0003,003,0002,318,336
2Nov 5, 2024 09:5459,346522,809,558490,575,0001,998,0002,473,984
3Nov 5, 2024 09:5459,347522,835,204490,580,0001,998,0002,478,080
4Nov 5, 2024 09:5459,347524,804,934489,585,0002,997,0002,326,528
5Nov 5, 2024 09:5459,347522,792,038489,583,0002,997,0002,326,528
6Nov 5, 2024 09:5459,350522,370,905489,607,0002,997,0002,326,528
7Nov 5, 2024 09:5459,355523,454,289489,653,0002,997,0002,326,528
8Nov 5, 2024 09:5459,359522,742,983489,684,0002,998,0002,318,336
9Nov 5, 2024 09:5459,360518,679,027489,686,0002,998,0002,326,528