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 25, 2024 00:21DiamondDenDiamondDenScore: 1,943,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2024 00:211,938,59916,131,533,49316,034,393,00055,976,0002,289,664
2Nov 25, 2024 00:211,943,11116,162,435,59716,061,848,00065,974,0002,281,472
3Nov 25, 2024 00:211,943,12616,160,061,83816,071,968,00055,978,0002,281,472
4Nov 25, 2024 00:211,943,18316,157,768,82816,061,443,00066,972,0002,281,472
5Nov 25, 2024 00:211,943,21816,157,144,36916,053,740,00074,970,0002,281,472
6Nov 25, 2024 00:211,943,22516,167,800,81216,048,808,00079,959,0002,281,472
7Nov 25, 2024 00:211,943,66116,167,703,57316,072,417,00059,971,0002,281,472
8Nov 25, 2024 00:211,944,70416,180,616,07716,080,063,00060,977,0002,281,472
9Nov 25, 2024 00:211,957,68316,281,430,77616,184,790,00063,975,0002,289,664