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 26, 2024 11:03NoSIMD_C#NoSIMD_C#Score: 62,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 11:0362,493544,663,931460,726,00057,965,0002,404,352
2Nov 26, 2024 11:0362,500544,396,867462,774,00055,972,0002,293,760
3Nov 26, 2024 11:0362,700546,146,537463,362,00057,044,0002,293,760