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 7, 2024 12:50NoSIMD_C#NoSIMD_C#Score: 81,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 12:5081,114697,730,597614,224,00059,021,0002,289,664
2Nov 7, 2024 12:5081,121700,023,121613,277,00060,027,0002,392,064
3Nov 7, 2024 12:5081,152708,814,182612,602,00060,960,0002,293,760
4Nov 7, 2024 12:5081,152699,771,916611,604,00061,959,0002,539,520
5Nov 7, 2024 12:5081,180700,573,785612,811,00060,981,0002,289,664
6Nov 7, 2024 12:5081,259707,049,176614,498,00059,951,0002,539,520
7Nov 7, 2024 12:5081,278704,159,722619,637,00054,967,0002,535,424
8Nov 7, 2024 12:5081,345704,659,988613,148,00062,015,0002,293,760
9Nov 7, 2024 12:5081,402706,919,631610,670,00064,964,0002,293,760