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 13:44George SeabridgeGeorge SeabridgeScore: 7,116Success
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 13:446,82766,696,04155,583,0001,089,0002,113,536
2Aug 1, 2026 13:446,82766,636,64955,586,0001,084,0002,113,536
3Aug 1, 2026 13:446,85166,859,85355,784,0001,086,0002,113,536
4Aug 1, 2026 13:447,02468,249,01857,220,0001,087,0002,113,536
5Aug 1, 2026 13:447,11669,063,87157,964,0001,107,0002,113,536
6Aug 1, 2026 13:448,15377,696,34066,576,0001,096,0002,113,536
7Aug 1, 2026 13:448,17777,897,49166,776,0001,096,0002,113,536
8Aug 1, 2026 13:448,19378,076,15866,959,0001,045,0002,113,536
9Aug 1, 2026 13:448,23878,585,35967,361,0001,018,0002,113,536