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 listMay 7, 2025 17:07rogue *rogue *Score: 68,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2025 17:0768,020591,459,840509,610,00054,957,0002,392,064
2May 7, 2025 17:0768,058591,288,506506,896,00057,988,0002,273,280
3May 7, 2025 17:0768,109591,607,664508,274,00057,030,0002,396,160
4May 7, 2025 17:0768,192587,973,963505,996,00059,999,0002,273,280
5May 7, 2025 17:0768,264595,579,998510,632,00055,959,0002,273,280
6May 7, 2025 17:0768,310593,647,291506,978,00059,997,0002,269,184
7May 7, 2025 17:0768,319590,395,529508,042,00059,004,0002,273,280
8May 7, 2025 17:0768,323593,923,005507,076,00060,009,0002,383,872
9May 7, 2025 17:0768,404593,560,982510,777,00056,975,0002,387,968