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:14George SeabridgeGeorge SeabridgeScore: 8,127Success
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:146,85166,867,67955,782,0001,085,0002,113,536
2Aug 1, 2026 13:146,86266,899,54155,956,0001,006,0002,113,536
3Aug 1, 2026 13:146,92568,741,57956,394,0001,089,0002,113,536
4Aug 1, 2026 13:147,15169,363,12758,264,0001,095,0002,113,536
5Aug 1, 2026 13:148,12777,426,16166,370,0001,090,0002,113,536
6Aug 1, 2026 13:148,12777,426,79266,444,0001,016,0002,113,536
7Aug 1, 2026 13:148,13977,533,69166,452,0001,103,0002,113,536
8Aug 1, 2026 13:148,16977,777,14266,719,0001,085,0002,113,536
9Aug 1, 2026 13:148,19178,003,98466,883,0001,106,0002,113,536