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 listNov 24, 2025 20:51Ham-HamHam-HamScore: 65,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 20:5165,272568,648,823539,756,0001,999,0002,269,184
2Nov 24, 2025 20:5165,273563,413,712539,765,0001,999,0002,289,664
3Nov 24, 2025 20:5165,273564,706,862541,766,00002,289,664
4Nov 24, 2025 20:5165,288564,809,247541,894,00002,289,664
5Nov 24, 2025 20:5165,290567,975,537540,908,000999,0002,281,472
6Nov 24, 2025 20:5165,291564,824,038539,917,0001,999,0002,531,328
7Nov 24, 2025 20:5165,295575,274,503541,948,00002,289,664
8Nov 24, 2025 20:5165,296571,759,669539,957,0001,999,0002,289,664
9Nov 24, 2025 20:5165,309568,897,799540,068,0002,000,0002,531,328