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 10, 2025 06:57NoSIMD_C#NoSIMD_C#Score: 50,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 06:5750,033434,029,995415,276,00002,437,120
2Feb 10, 2025 06:5750,040438,700,100415,336,00002,531,328
3Feb 10, 2025 06:5750,044439,457,567415,368,00002,269,184
4Feb 10, 2025 06:5750,049441,180,491414,407,0001,000,0002,531,328
5Feb 10, 2025 06:5750,066444,390,393413,554,0001,997,0002,531,328
6Feb 10, 2025 06:5750,076443,048,045414,630,000999,0002,269,184
7Feb 10, 2025 06:5750,079443,206,570414,654,000999,0002,531,328
8Feb 10, 2025 06:5750,087438,897,325414,725,000999,0002,531,328
9Feb 10, 2025 06:5750,094438,201,434414,785,000999,0002,269,184