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 7, 2026 14:36TonyTonyScore: 7,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 14:377,47771,905,22659,968,0002,099,0002,113,536
2Aug 7, 2026 14:377,50672,105,37660,197,0002,111,0002,113,536
3Aug 7, 2026 14:377,51372,236,66560,197,0002,169,0002,113,536
4Aug 7, 2026 14:377,53072,270,49860,281,0002,221,0002,113,536
5Aug 7, 2026 14:377,53072,261,80260,343,0002,157,0002,113,536
6Aug 7, 2026 14:377,53072,250,88560,223,0002,276,0002,113,536
7Aug 7, 2026 14:377,54972,677,57160,410,0002,248,0002,113,536
8Aug 7, 2026 14:377,58672,761,65060,704,0002,263,0002,113,536
9Aug 7, 2026 14:377,59072,906,67060,712,0002,288,0002,113,536