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 22:22zielajzielajScore: 4,292Success
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 22:224,07659,853,27932,834,000994,0002,514,944
2Nov 20, 2024 22:224,07658,838,48832,836,000995,0002,338,816
3Nov 20, 2024 22:224,09355,809,18231,970,0001,998,0002,514,944
4Nov 20, 2024 22:224,29264,916,28234,608,0001,017,0002,363,392
5Nov 20, 2024 22:224,31863,759,66334,842,000995,0002,523,136
6Nov 20, 2024 22:224,31867,418,92133,849,0001,991,0002,531,328