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 listOct 14, 2024 16:00Joad NacerJoad NacerScore: 4,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:004,37958,085,95135,337,0001,009,0002,297,856
2Oct 14, 2024 16:004,40361,178,74536,547,00002,273,280
3Oct 14, 2024 16:004,43959,305,80535,850,000995,0002,289,664
4Oct 14, 2024 16:004,44759,166,59834,914,0001,995,0002,306,048
5Oct 14, 2024 16:004,49960,599,85436,335,0001,009,0002,297,856
6Oct 14, 2024 16:004,72960,008,33736,232,0003,019,0002,301,952