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 listFeb 12, 2025 10:34xupeng101223xupeng101223Score: 1,883,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 10:341,882,96515,657,745,46015,556,641,00071,970,0002,277,376
2Feb 12, 2025 10:341,883,55315,668,514,86015,575,514,00057,972,0002,289,664
3Feb 12, 2025 10:341,883,71415,668,029,21515,542,871,00091,957,0002,289,664
4Feb 12, 2025 10:341,883,73415,665,436,15315,558,025,00076,965,0002,289,664
5Feb 12, 2025 10:341,883,76115,667,570,55515,543,255,00091,960,0002,269,184
6Feb 12, 2025 10:341,883,92215,668,884,89515,570,587,00065,968,0002,277,376
7Feb 12, 2025 10:341,884,12215,668,771,96015,562,247,00075,962,0002,277,376
8Feb 12, 2025 10:341,884,55815,671,717,56515,579,857,00061,971,0002,277,376
9Feb 12, 2025 10:341,909,47115,883,843,96015,791,629,00056,977,0002,265,088