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 19, 2024 01:19zielajzielajScore: 3,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 01:193,52252,746,85228,223,0001,007,0002,379,776
2Nov 19, 2024 01:193,53051,747,54227,277,0002,020,0002,371,584
3Nov 19, 2024 01:193,56560,084,45828,571,0001,020,0002,514,944
4Nov 19, 2024 01:193,96453,262,26931,905,000997,0002,269,184
5Nov 19, 2024 01:194,02960,876,40132,430,0001,013,0002,265,088
6Nov 19, 2024 01:194,22553,438,95034,064,0001,001,0002,265,088