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 listDec 7, 2024 04:55NoSIMD_C#NoSIMD_C#Score: 62,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 7, 2024 04:4762,310541,601,760449,154,00068,023,0002,289,664
2Dec 7, 2024 04:4762,387542,800,653457,838,00059,978,0002,535,424
3Dec 7, 2024 04:4762,412546,432,288458,018,00060,002,0002,347,008
4Dec 7, 2024 04:5562,415545,328,400455,036,00063,005,0002,535,424
5Dec 7, 2024 04:5562,450540,423,900455,298,00063,041,0002,293,760
6Dec 7, 2024 04:5562,704550,979,241467,396,00053,045,0002,424,832