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:22CheranMahalingamCheranMahalingamScore: 1,310,874Success
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:221,305,83710,878,894,60210,769,482,00068,964,0002,281,472
2Nov 5, 2024 23:221,307,38510,879,502,98110,781,329,00069,969,0002,293,760
3Nov 5, 2024 23:221,309,21910,899,618,11510,800,553,00065,966,0002,281,472
4Nov 5, 2024 23:221,309,41610,905,668,07110,780,195,00087,960,0002,293,760
5Nov 5, 2024 23:221,310,87410,910,625,50710,813,285,00066,970,0002,269,184
6Nov 5, 2024 23:221,311,00310,908,791,49210,814,350,00066,971,0002,523,136
7Nov 5, 2024 23:221,311,34410,914,152,52010,829,178,00054,975,0002,265,088
8Nov 5, 2024 23:221,311,77110,917,322,88710,819,731,00067,966,0002,281,472
9Nov 5, 2024 23:221,311,79210,919,585,38310,823,903,00063,969,0002,281,472