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 listApr 13, 2024 16:40E SequeiraE SequeiraScore: 19,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2024 16:4019,764227,421,502164,041,52702,232,320
2Apr 13, 2024 16:4019,799195,689,492164,331,00002,289,664
3Apr 13, 2024 16:4019,809188,342,490164,415,00002,285,568
4Apr 13, 2024 16:4019,810186,549,439163,424,0001,002,0002,506,752
5Apr 13, 2024 16:4019,812190,919,139164,436,00002,285,568
6Apr 13, 2024 16:4019,827190,733,670163,565,0001,003,0002,347,008
7Apr 13, 2024 16:4019,836189,567,301163,645,000997,0002,285,568
8Apr 13, 2024 16:4019,846190,722,988163,725,000998,0002,506,752
9Apr 13, 2024 16:4019,851197,091,813162,765,0001,997,0002,285,568
10Apr 13, 2024 16:4020,199239,300,717167,648,22302,236,416
11Apr 13, 2024 16:4020,218235,263,684167,810,27602,232,320
12Apr 13, 2024 16:4020,286190,862,213167,370,0001,002,0002,502,656