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 6, 2024 14:33NoSIMD_C#NoSIMD_C#Score: 102,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 14:33102,254881,267,248718,755,000129,955,0002,527,232
2Nov 6, 2024 14:33102,292872,948,919719,021,000130,003,0002,547,712
3Nov 6, 2024 14:33102,388885,996,375735,848,000113,976,0002,293,760
4Nov 6, 2024 14:33102,582880,298,779710,523,000140,905,0002,539,520
5Nov 6, 2024 14:33102,750880,644,474716,854,000135,972,0002,293,760
6Nov 6, 2024 14:33102,825885,178,993715,536,000137,910,0002,539,520
7Nov 6, 2024 14:33102,886877,892,460734,960,000118,993,0002,289,664
8Nov 6, 2024 14:33102,899876,086,510751,057,000103,007,0002,306,048
9Nov 6, 2024 14:33103,359888,720,448729,899,000127,982,0002,310,144