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 07:20George SeabridgeGeorge SeabridgeScore: 9,728Success
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 07:208,60483,477,08470,334,0001,086,0002,113,536
2Aug 2, 2026 07:208,61281,399,97170,397,0001,083,0002,113,536
3Aug 2, 2026 07:208,61583,613,38270,415,0001,094,0002,113,536
4Aug 2, 2026 07:209,71991,417,50879,574,0001,098,0002,113,536
5Aug 2, 2026 07:209,72891,415,40479,648,0001,095,0002,113,536
6Aug 2, 2026 07:209,73191,379,69579,677,0001,094,0002,113,536
7Aug 2, 2026 07:209,73891,583,91479,732,0001,101,0002,113,536
8Aug 2, 2026 07:209,74691,675,43979,797,0001,098,0002,113,536
9Aug 2, 2026 07:209,77291,126,45079,869,0001,243,0002,113,536