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 25, 2024 08:15Javid izadiJavid izadiScore: 89,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 08:1589,737770,034,607568,863,000175,957,0002,301,952
2Dec 25, 2024 08:1589,791771,623,401569,438,000175,826,0002,289,664
3Dec 25, 2024 08:1590,304779,661,151573,635,000175,888,0002,269,184