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 1, 2022 13:25Sergey SlotinSergey SlotinScore: 19,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2022 13:2519,564183,145,561159,372,0003,007,0002,273,280
2Oct 1, 2022 13:2519,566184,424,025159,387,0003,007,0002,273,280
3Oct 1, 2022 13:2519,567187,263,258161,407,0001,002,0002,506,752
4Oct 1, 2022 13:2519,571184,608,688159,433,0003,008,0002,502,656
5Oct 1, 2022 13:2519,583189,902,237160,530,0002,006,0002,273,280
6Oct 1, 2022 13:2519,593189,193,174162,618,00002,506,752
7Oct 1, 2022 13:2519,595185,760,317160,642,0001,995,0002,506,752
8Oct 1, 2022 13:2519,632186,200,532160,947,0001,999,0002,338,816
9Oct 1, 2022 13:2519,646186,243,782161,058,0002,000,0002,273,280
10Oct 1, 2022 13:2522,430243,965,970186,169,30002,281,472
11Oct 1, 2022 13:2522,433256,496,482186,194,13702,281,472
12Oct 1, 2022 13:2522,433240,090,500186,194,69702,277,376