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:52NoSIMD_C#NoSIMD_C#Score: 72,597Success
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:5272,530628,567,897578,997,00022,999,0002,297,856
2Nov 7, 2024 12:5272,558626,585,149561,218,00041,015,0002,539,520
3Nov 7, 2024 12:5272,584628,310,565547,408,00055,041,0002,297,856
4Nov 7, 2024 12:5272,585630,412,315555,420,00047,035,0002,306,048
5Nov 7, 2024 12:5272,597634,060,599575,574,00026,980,0002,293,760
6Nov 7, 2024 12:5272,620633,467,261544,774,00057,976,0002,293,760
7Nov 7, 2024 12:5272,624633,965,598555,796,00046,982,0002,289,664
8Nov 7, 2024 12:5272,633629,260,773529,876,00072,982,0002,289,664
9Nov 7, 2024 12:5272,637633,965,012561,892,00040,992,0002,293,760