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 listApr 23, 2025 08:20NoSIMD_C#NoSIMD_C#Score: 71,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 08:1671,316621,073,914530,932,00060,992,0002,469,888
2Apr 23, 2025 08:2071,428620,339,653536,866,00055,986,0002,547,712
3Apr 23, 2025 08:1671,442619,793,445532,975,00059,997,0002,478,080
4Apr 23, 2025 08:2071,599616,981,537538,245,00056,025,0002,543,616
5Apr 23, 2025 08:2071,640625,767,551536,648,00057,962,0002,289,664
6Apr 23, 2025 08:1671,679625,974,380533,942,00060,993,0002,461,696