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 listFeb 9, 2025 02:20Code HintsCode HintsScore: 119,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2025 02:20119,2901,012,977,974989,110,0001,000,0002,535,424
2Feb 9, 2025 02:20119,3021,017,292,827988,210,0001,998,0002,535,424
3Feb 9, 2025 02:20119,3371,017,811,067987,498,0002,998,0002,433,024