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 7, 2024 12:31NoSIMD_C#NoSIMD_C#Score: 81,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 12:3181,154699,675,475614,619,00058,963,0002,539,520
2Nov 7, 2024 12:3181,182699,526,752609,826,00063,981,0002,293,760
3Nov 7, 2024 12:3181,187705,804,443613,867,00059,987,0002,293,760
4Nov 7, 2024 12:3181,195704,165,013608,925,00064,991,0002,539,520
5Nov 7, 2024 12:3181,246704,174,510615,402,00058,942,0002,539,520
6Nov 7, 2024 12:3181,270699,340,096608,583,00065,954,0002,441,216
7Nov 7, 2024 12:3181,283707,816,362612,679,00061,967,0002,293,760
8Nov 7, 2024 12:3181,752704,356,250621,583,00056,961,0002,379,776
9Nov 7, 2024 12:3181,965712,726,182632,291,00048,022,0002,433,024