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 21, 2026 01:25Andrew EpsteinAndrew EpsteinScore: 4,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 01:254,47746,858,74034,882,0002,281,0002,113,536
2Aug 21, 2026 01:254,47847,013,48634,781,0002,391,0002,113,536
3Aug 21, 2026 01:254,48447,009,97334,932,0002,288,0002,113,536
4Aug 21, 2026 01:254,49047,045,72934,983,0002,289,0002,113,536
5Aug 21, 2026 01:254,49047,174,59234,973,0002,294,0002,113,536
6Aug 21, 2026 01:254,49047,054,59634,980,0002,293,0002,113,536
7Aug 21, 2026 01:254,53147,341,05735,301,0002,314,0002,113,536
8Aug 21, 2026 01:254,58247,897,24935,678,0002,356,0002,113,536
9Aug 21, 2026 01:254,58747,784,31535,777,0002,296,0002,113,536