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 15, 2025 23:03mounalisaaamounalisaaaScore: 1,823,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 23:031,819,13215,140,202,21115,035,828,00062,969,0002,289,664
2Apr 15, 2025 23:031,820,44715,141,053,91915,043,739,00065,972,0002,277,376
3Apr 15, 2025 23:031,822,95815,160,425,21215,063,577,00066,971,0002,277,376
4Apr 15, 2025 23:031,823,34115,164,120,21115,062,762,00070,970,0002,363,392
5Apr 15, 2025 23:031,823,51215,172,926,91215,061,186,00073,966,0002,277,376
6Apr 15, 2025 23:031,823,81115,169,104,48415,064,668,00072,964,0002,277,376
7Apr 15, 2025 23:031,824,08615,173,439,13215,076,947,00062,970,0002,277,376
8Apr 15, 2025 23:031,825,19015,190,451,54015,089,104,00059,972,0002,265,088
9Apr 15, 2025 23:031,827,27615,196,674,08915,088,425,00077,966,0002,277,376