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:41NoSIMD_C#NoSIMD_C#Score: 106,096Success
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:41105,770906,434,851755,906,000121,984,0002,289,664
2Nov 6, 2024 12:41105,922900,807,451764,131,000115,019,0002,539,520
3Nov 6, 2024 12:41105,938910,320,971756,387,000122,900,0002,289,664
4Nov 6, 2024 12:41105,970905,551,840758,610,000120,937,0002,535,424
5Nov 6, 2024 12:41106,096909,081,372764,648,000115,946,0002,297,856
6Nov 6, 2024 12:41106,096907,593,030757,654,000122,943,0002,293,760
7Nov 6, 2024 12:41106,100905,862,459759,685,000120,949,0002,289,664
8Nov 6, 2024 12:41106,120907,791,728777,821,000102,976,0002,551,808
9Nov 6, 2024 12:41106,613914,872,244762,902,000121,984,0002,535,424