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 3, 2025 19:54Jack FrigaardJack FrigaardScore: 5,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2025 19:545,06364,858,59440,024,0002,001,0002,519,040
2Aug 3, 2025 19:545,07169,498,09139,081,0003,006,0002,519,040
3Aug 3, 2025 19:545,07369,022,80839,095,0003,007,0002,519,040
4Aug 3, 2025 19:545,07469,984,01739,108,0003,008,0002,510,848
5Aug 3, 2025 19:545,07569,694,75241,123,0001,003,0002,453,504
6Aug 3, 2025 19:545,07670,043,60839,122,0003,009,0002,514,944
7Aug 3, 2025 19:545,07766,613,25539,129,0003,009,0002,445,312
8Aug 3, 2025 19:545,07864,234,74939,136,0003,010,0002,514,944
9Aug 3, 2025 19:545,07864,806,02040,139,0002,006,0002,514,944
10Aug 3, 2025 19:545,07868,098,11041,143,0001,003,0002,449,408
11Aug 3, 2025 19:545,07966,261,51139,146,0003,011,0002,445,312
12Aug 3, 2025 19:545,08168,700,81039,162,0003,012,0002,514,944