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 14:48CodeReclaimersCodeReclaimersScore: 5,340Success
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 14:485,33054,246,89943,033,0001,207,0002,113,536
2Aug 2, 2026 14:485,33254,231,79943,059,0001,199,0002,113,536
3Aug 2, 2026 14:485,33354,259,28943,068,0001,204,0002,113,536
4Aug 2, 2026 14:485,34054,456,14743,311,0001,015,0002,113,536
5Aug 2, 2026 14:485,34054,274,35843,201,0001,121,0002,113,536
6Aug 2, 2026 14:485,34454,335,84843,155,0001,208,0002,113,536
7Aug 2, 2026 14:485,47555,429,73744,430,0001,013,0002,113,536
8Aug 2, 2026 14:485,48356,751,47344,494,0001,015,0002,113,536
9Aug 2, 2026 14:485,52556,059,95744,852,0001,013,0002,113,536