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 listDec 19, 2024 20:07Javid izadiJavid izadiScore: 376,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 20:07374,8243,141,180,7543,046,082,00064,959,0002,281,472
2Dec 19, 2024 20:07376,0713,146,574,5193,058,424,00062,967,0002,281,472
3Dec 19, 2024 20:07377,4833,160,399,0243,075,141,00057,964,0002,285,568