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 11, 2024 17:11NoSIMD_C#NoSIMD_C#Score: 67,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 17:1167,675590,311,487499,738,00061,967,0002,293,760
2Nov 11, 2024 17:1167,678592,541,416503,754,00057,971,0002,301,952
3Nov 11, 2024 17:1167,698587,703,228498,906,00062,988,0002,396,160
4Nov 11, 2024 17:1167,701596,484,216498,931,00062,991,0002,539,520
5Nov 11, 2024 17:1167,705586,551,437498,960,00062,994,0002,547,712
6Nov 11, 2024 17:1167,784591,156,700496,651,00065,953,0002,301,952
7Nov 11, 2024 17:1167,827589,860,471503,968,00058,996,0002,539,520
8Nov 11, 2024 17:1167,902590,796,140496,636,00066,950,0002,535,424
9Nov 11, 2024 17:1168,023590,444,711504,637,00059,956,0002,297,856