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 6, 2024 12:49NoSIMD_C#NoSIMD_C#Score: 106,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 12:49105,914908,495,466746,071,000133,012,0002,551,808
2Nov 6, 2024 12:49105,993904,326,922746,778,000132,960,0002,539,520
3Nov 6, 2024 12:49106,016912,837,401789,941,00089,993,0002,293,760
4Nov 6, 2024 12:49106,059905,413,269767,250,000113,036,0002,539,520
5Nov 6, 2024 12:49106,094906,262,453743,647,000136,935,0002,293,760
6Nov 6, 2024 12:49106,101908,789,192758,690,000121,950,0002,539,520
7Nov 6, 2024 12:49106,147908,915,637747,021,000134,003,0002,301,952
8Nov 6, 2024 12:49106,212906,740,412763,616,000117,940,0002,293,760
9Nov 6, 2024 12:49106,683915,710,732752,548,000132,920,0002,527,232