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 listDec 5, 2024 11:14Yingxin JiangYingxin JiangScore: 1,826,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2024 11:141,823,18215,167,955,04815,053,442,00078,965,0002,285,568
2Dec 5, 2024 11:141,825,35815,182,192,24615,075,501,00074,967,0002,285,568
3Dec 5, 2024 11:141,825,95615,189,836,82615,086,463,00068,970,0002,277,376
4Dec 5, 2024 11:141,826,02515,184,854,48415,089,031,00066,973,0002,277,376
5Dec 5, 2024 11:141,826,54915,194,898,94515,083,393,00076,966,0002,277,376
6Dec 5, 2024 11:141,827,15215,192,374,44315,087,390,00077,971,0002,510,848
7Dec 5, 2024 11:141,829,03415,210,211,40415,111,014,00069,972,0002,277,376
8Dec 5, 2024 11:141,829,64215,223,060,03015,115,056,00070,976,0002,277,376
9Dec 5, 2024 11:141,834,17715,257,659,05015,159,696,00063,969,0002,277,376