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 2, 2026 12:02George SeabridgeGeorge SeabridgeScore: 7,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 12:037,79274,618,82663,591,0001,089,0002,113,536
2Aug 2, 2026 12:037,79974,676,11963,656,0001,080,0002,113,536
3Aug 2, 2026 12:037,80774,749,12763,723,0001,082,0002,113,536
4Aug 2, 2026 12:037,82374,919,74063,840,0001,092,0002,113,536
5Aug 2, 2026 12:037,82574,870,43363,864,0001,085,0002,113,536
6Aug 2, 2026 12:037,83374,957,31863,928,0001,090,0002,113,536
7Aug 2, 2026 12:037,83375,106,76663,902,0001,114,0002,113,536
8Aug 2, 2026 12:037,83675,028,25064,023,0001,016,0002,113,536
9Aug 2, 2026 12:037,83674,935,25763,961,0001,083,0002,113,536