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 27, 2024 12:16NoSIMD_C#NoSIMD_C#Score: 76,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 12:1676,034660,874,209629,082,0002,000,0002,543,616
2Nov 27, 2024 12:1676,053659,949,923629,238,0002,000,0002,297,856
3Nov 27, 2024 12:1676,092662,251,993630,561,000999,0002,543,616