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 12:23ZOTTIGZOTTIGScore: 87,279Success
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 12:2386,932751,065,025652,582,00068,955,0002,347,008
2Nov 11, 2024 12:2387,033746,313,071649,434,00072,936,0002,355,200
3Nov 11, 2024 12:2387,090756,589,881648,861,00073,984,0002,420,736
4Nov 11, 2024 12:2387,193749,249,992650,732,00072,969,0002,543,616
5Nov 11, 2024 12:2387,279750,309,775651,472,00072,940,0002,543,616
6Nov 11, 2024 12:2387,336750,156,076650,898,00073,988,0002,535,424
7Nov 11, 2024 12:2387,357753,076,513651,057,00074,006,0002,547,712
8Nov 11, 2024 12:2387,516756,331,467645,454,00080,931,0002,363,392
9Nov 11, 2024 12:2387,758758,853,795653,458,00074,937,0002,482,176