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 listMay 5, 2025 07:46parsersmailparsersmailScore: 100,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2025 07:46100,354855,662,079829,940,0002,999,0002,330,624
2May 5, 2025 07:46100,389860,999,611830,229,0003,000,0002,330,624
3May 5, 2025 07:46100,772863,586,804835,407,000999,0002,330,624