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 08:44parsersmailparsersmailScore: 66,730Success
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 08:4466,722577,820,028551,793,0001,999,0002,359,296
2May 5, 2025 08:4466,726586,980,635551,830,0001,999,0002,347,008
3May 5, 2025 08:4466,729580,131,451550,854,0002,999,0002,355,200
4May 5, 2025 08:4466,729580,137,975550,853,0002,999,0002,359,296
5May 5, 2025 08:4466,730580,387,818551,864,0001,999,0002,375,680
6May 5, 2025 08:4466,733578,589,808551,887,0001,999,0002,355,200
7May 5, 2025 08:4466,739579,653,832551,933,0001,999,0002,392,064
8May 5, 2025 08:4466,749575,920,515552,013,0002,000,0002,351,104
9May 5, 2025 08:4466,758576,632,340551,090,0003,000,0002,351,104