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:48George SeabridgeGeorge SeabridgeScore: 8,148Success
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:486,81666,790,66955,491,0001,083,0002,113,536
2Aug 1, 2026 13:486,81866,605,66755,504,0001,087,0002,113,536
3Aug 1, 2026 13:486,81866,615,59955,511,0001,082,0002,113,536
4Aug 1, 2026 13:488,13777,561,11566,319,0001,226,0002,113,536
5Aug 1, 2026 13:488,14877,736,92266,540,0001,090,0002,113,536
6Aug 1, 2026 13:488,15477,730,18566,478,0001,207,0002,113,536
7Aug 1, 2026 13:488,16577,810,25766,679,0001,094,0002,113,536
8Aug 1, 2026 13:488,23378,298,23867,319,0001,023,0002,113,536
9Aug 1, 2026 13:488,28678,719,19367,756,0001,022,0002,113,536