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 7, 2024 21:08Joad NacerJoad NacerScore: 8,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 21:087,33980,245,50359,918,000998,0002,428,928
2Oct 7, 2024 21:087,34882,038,90158,987,0001,999,0002,273,280
3Oct 7, 2024 21:087,35485,958,95660,035,0001,000,0002,535,424
4Oct 7, 2024 21:088,24788,978,14168,453,00002,531,328
5Oct 7, 2024 21:088,290100,831,59366,816,0001,994,0002,424,832
6Oct 7, 2024 21:088,32193,561,23468,067,0001,000,0002,428,928