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 24, 2025 10:35Jeffrey JianJeffrey JianScore: 2,068,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 10:352,064,83717,168,554,49917,083,177,00054,974,0002,260,992
2Nov 24, 2025 10:352,065,12817,175,403,54117,082,589,00057,971,0002,277,376
3Nov 24, 2025 10:352,066,62117,184,578,29317,091,981,00060,971,0002,289,664
4Nov 24, 2025 10:352,068,50117,198,773,04817,096,590,00071,968,0002,519,040
5Nov 24, 2025 10:352,068,98617,206,571,94117,115,606,00056,975,0002,277,376
6Nov 24, 2025 10:352,069,13017,203,761,86917,096,815,00076,963,0002,277,376
7Nov 24, 2025 10:352,069,21117,208,888,54817,105,491,00068,961,0002,277,376
8Nov 24, 2025 10:352,069,51617,207,239,89517,110,021,00066,964,0002,277,376
9Nov 24, 2025 10:352,202,73318,314,750,73218,202,726,00079,959,0002,277,376