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 5, 2024 23:25CheranMahalingamCheranMahalingamScore: 1,277,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 23:251,270,26910,571,309,14910,480,258,00062,971,0002,289,664
2Nov 5, 2024 23:251,274,54010,612,643,34010,516,712,00061,968,0002,281,472
3Nov 5, 2024 23:251,274,61210,612,016,37310,518,314,00060,967,0002,281,472
4Nov 5, 2024 23:251,276,54710,624,094,76410,524,374,00070,968,0002,281,472
5Nov 5, 2024 23:251,277,20310,631,711,26210,523,821,00076,962,0002,281,472
6Nov 5, 2024 23:251,277,45610,641,198,75010,528,915,00073,971,0002,293,760
7Nov 5, 2024 23:251,277,85910,636,583,58710,523,265,00082,962,0002,289,664
8Nov 5, 2024 23:251,278,31610,646,516,47910,539,064,00070,960,0002,281,472
9Nov 5, 2024 23:251,316,66110,954,295,90610,870,310,00057,974,0002,281,472