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:43George SeabridgeGeorge SeabridgeScore: 8,154Success
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:436,83766,755,87255,667,0001,086,0002,113,536
2Aug 1, 2026 13:436,84466,778,61455,718,0001,089,0002,113,536
3Aug 1, 2026 13:438,14877,767,52266,544,0001,090,0002,113,536
4Aug 1, 2026 13:438,15378,049,60566,580,0001,098,0002,113,536
5Aug 1, 2026 13:438,15477,742,33566,588,0001,096,0002,113,536
6Aug 1, 2026 13:438,15677,809,49766,594,0001,105,0002,113,536
7Aug 1, 2026 13:438,15677,701,08166,596,0001,105,0002,113,536
8Aug 1, 2026 13:438,17777,877,38566,778,0001,097,0002,113,536
9Aug 1, 2026 13:438,18977,938,46366,871,0001,100,0002,113,536