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 listFeb 28, 2025 05:20NoSIMD_C#NoSIMD_C#Score: 106,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2025 05:20105,860939,429,757827,546,00051,095,0002,461,696
2Feb 28, 2025 05:20106,166943,120,537842,128,00039,052,0002,347,008
3Feb 28, 2025 05:20106,410950,667,455822,118,00061,083,0002,342,912