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 11, 2025 20:40Ian MckibbenIan MckibbenScore: 12,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 20:4011,730116,834,87697,355,00002,269,184
2Aug 11, 2025 20:4011,731120,178,42897,367,00002,424,832
3Aug 11, 2025 20:4011,735116,403,85396,394,0001,004,0002,531,328
4Aug 11, 2025 20:4011,739116,883,43297,433,00002,433,024
5Aug 11, 2025 20:4012,022123,185,76097,784,0001,995,0002,433,024
6Aug 11, 2025 20:4012,022128,677,24998,788,000997,0002,531,328
7Aug 11, 2025 20:4012,024123,701,51198,800,000997,0002,531,328
8Aug 11, 2025 20:4012,024122,197,90098,802,000998,0002,531,328
9Aug 11, 2025 20:4012,025133,503,17598,808,000998,0002,269,184
10Aug 11, 2025 20:4015,779154,553,266128,967,0001,999,0002,269,184
11Aug 11, 2025 20:4015,781161,177,447128,987,0001,999,0002,269,184
12Aug 11, 2025 20:4015,789156,523,588129,050,0002,000,0002,531,328