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 listDec 7, 2024 05:08NoSIMD_C#NoSIMD_C#Score: 62,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 7, 2024 04:5562,036541,474,242457,907,00056,988,0002,473,984
2Dec 7, 2024 05:0862,076543,307,660451,202,00064,028,0002,469,888
3Dec 7, 2024 04:5562,104539,089,028466,417,00049,043,0002,289,664
4Dec 7, 2024 04:5562,124547,443,383462,667,00052,961,0002,531,328
5Dec 7, 2024 05:0862,157548,071,506463,915,00051,990,0002,535,424
6Dec 7, 2024 05:0862,525547,972,912460,964,00057,995,0002,473,984