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 listAug 1, 2026 21:07TonyTonyScore: 59,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 21:0759,662503,469,915494,196,0001,001,0002,117,632
2Aug 1, 2026 21:0759,670503,638,653494,264,0001,002,0002,117,632
3Aug 1, 2026 21:0759,681503,918,078494,354,0001,002,0002,117,632
4Aug 1, 2026 21:0759,683503,847,941494,373,0001,002,0002,117,632
5Aug 1, 2026 21:0759,685503,816,732494,389,0001,003,0002,117,632
6Aug 1, 2026 21:0759,686503,897,373494,397,0001,003,0002,117,632
7Aug 1, 2026 21:0759,688503,874,812494,415,0001,002,0002,117,632
8Aug 1, 2026 21:0759,693504,036,289494,450,0001,004,0002,117,632
9Aug 1, 2026 21:0763,005531,228,915521,946,0001,003,0002,117,632