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:11Joad NacerJoad NacerScore: 4,482Success
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:114,37754,695,02033,299,0003,027,0002,535,424
2Oct 14, 2024 16:114,39458,106,09034,444,0002,026,0002,297,856
3Oct 14, 2024 16:114,41463,945,83835,619,0001,017,0002,301,952
4Oct 14, 2024 16:114,43962,952,36135,845,000995,0002,301,952
5Oct 14, 2024 16:114,44064,505,40933,868,0002,988,0002,301,952
6Oct 14, 2024 16:114,44265,317,63433,876,0002,989,0002,301,952
7Oct 14, 2024 16:114,48256,307,79836,198,0001,005,0002,531,328
8Oct 14, 2024 16:114,48657,646,62137,237,00002,531,328
9Oct 14, 2024 16:114,49160,747,00935,260,0002,014,0002,301,952
10Oct 14, 2024 16:114,49160,337,63235,258,0002,014,0002,269,184
11Oct 14, 2024 16:114,49157,763,47136,266,0001,007,0002,392,064
12Oct 14, 2024 16:114,51356,466,53637,462,00002,269,184